Martina Bonelli
Foster-Lyapunov criteria with stopping times and applications to Stochastic Reaction Networks.
Rel. Daniele Cappelletti. Politecnico di Torino, Corso di laurea magistrale in Ingegneria Matematica, 2024
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview |
Abstract
The main objective in this thesis is to obtain a unified approach to the stability classification of continuous-time Markov chains defined on discrete state space via Foster-Lyapunov criteria. These criteria are tipically stated in terms of the generator of the process. Aleksandr Lyapunov first introduced these techniques for the study of ordinary differential equations and F. Gordon Foster first adapted them to a stochastic setting. After an introduction of the preliminaries about the main setting of work, a version of Dynkin's formula and its proof are provided. Ruling out unstable behaviours of the Markov chains such as explosivity or transience and establishing recurrence and positive recurrence is a complex task.
In these regards, the second chapter analyzes the Foster-Lyapunov criteria that imply these properties and the results are proved by the systematic application of Dynkin's formula
Tipo di pubblicazione
URI
![]() |
Modifica (riservato agli operatori) |
