National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Strong stationary times and convergence of Markov chains
Suk, Luboš ; Prokešová, Michaela (advisor) ; Kříž, Pavel (referee)
In this thesis we study the estimation of speed of convergence of Markov chains to their stacionary distributions. For that purpose we will use the method of strong stationary times. We focus on irreducible and aperiodic chains only since in that case the existence of exactly one stationary distribution is guaranteed. We introduce the mixing time for a Markov chain as the time needed for the marginal distribution of the chain to be sufficiently close to the stationary dis- tribution. The distance between two distributions is measured by the total variation distance. The main goal of this thesis is to construct an appropriate strong stationary time for selected chains and then use it for obtaining an upper bound for the mixing time.
Strong stationary times and convergence of Markov chains
Suk, Luboš ; Prokešová, Michaela (advisor) ; Kříž, Pavel (referee)
In this thesis we study the estimation of speed of convergence of Markov chains to their stacionary distributions. For that purpose we will use the method of strong stationary times. We focus on irreducible and aperiodic chains only since in that case the existence of exactly one stationary distribution is guaranteed. We introduce the mixing time for a Markov chain as the time needed for the marginal distribution of the chain to be sufficiently close to the stationary dis- tribution. The distance between two distributions is measured by the total variation distance. The main goal of this thesis is to construct an appropriate strong stationary time for selected chains and then use it for obtaining an upper bound for the mixing time.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.