The distribution of Mixing Times in Markov Chains
Files
Date
Authors
Supervisor
Item type
Commissioned Report
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
arXiv
Abstract
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the Markov chain. Expressions for the probability generating function, and hence the probability distribution of the mixing time starting in state i are derived and special cases explored. This extends the results of the author regarding the expected time to mixing [J.J. Hunter, Mixing times with applications to perturbed Markov chains, Linear Algebra Appl. 417 (2006) 108–123], and the variance of the times to mixing, [J.J. Hunter, Variances of first passage times in a Markov chain with applications to mixing times, Linear Algebra Appl. 429 (2008) 1135–1162]. Some new results for the distribution of recurrence and first passage times in three-state Markov chain are also presented.Description
Source
arXiv:1111.0151
DOI
Publisher's version
Rights statement
arXiv does not ask that copyright be transferred. However, we require sufficient rights to allow us to distribute submitted articles in perpetuity. In order to submit an article to arXiv, the submitter must either:
grant arXiv.org a non-exclusive and irrevocable license to distribute the article, and certify that they have the right to grant this license,
certify that the work is available under either the Creative Commons Attribution license, or the Creative Commons Attribution-Noncommercial-ShareAlike license, and that they have the right to grant this license, or certify that the work is in the public domain (http://arxiv.org/help/license)