Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-10T21:18:17.220Z Has data issue: false hasContentIssue false
  • English
  • Français

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups

Part of: Markov processes

Published online by Cambridge University Press:  30 January 2018

Guan-Yu Chen  and
Laurent Saloff-Coste
Guan-Yu Chen*
Affiliation:
National Chiao Tung University
Laurent Saloff-Coste*
Affiliation:
Cornell University
*
∗ Postal address: Department of Applied Mathematics, National Chiao Tung University, Hsinchu 300, Taiwan. Email address: gychen@math.nctu.edu.tw
∗∗ Postal address: Malott Hall, Department of Mathematics, Cornell University, Ithaca, NY 14853-4201. Email address: lsc@math.cornell.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We make a connection between the continuous time and lazy discrete time Markov chains through the comparison of cutoffs and mixing time in total variation distance. For illustration, we consider finite birth and death chains and provide a criterion on cutoffs using eigenvalues of the transition matrix.

Keywords

Markov chaincutoff phenomenon

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 60J27: Continuous-time Markov processes on discrete state spaces
Type
Research Article
Information
Journal of Applied Probability , Volume 50 , Issue 4 , December 2013 , pp. 943 - 959
Copyright
© Applied Probability Trust 

References

Aldous, D. and Diaconis, P. (1987). Strong uniform times and finite random walks. Adv. Appl. Math. 8, 69–97.CrossRefGoogle Scholar
Aldous, D. and Fill, J. Reversible Markov Chains and Random Walks on Graphs. Available at http://www. stat.berkeley.edu/users/aldous/RWG/book.html.Google Scholar
Brown, M. and Shao, Y.-S. (1987). Identifying coefficients in the spectral representation for first passage time distributions. Prob. Eng. Inf. Sci. 1, 69–74.CrossRefGoogle Scholar
Chen, G.-Y. (2006). The cutoff phenomenon for finite Markov chains. Doctoral Thesis, Cornell University.Google Scholar
Chen, G.-Y. and Saloff-Coste, L. (2008). The cutoff phenomenon for ergodic Markov processes. Electron. J. Prob. 13, 26–78.CrossRefGoogle Scholar
Chen, G.-Y. and Saloff-Coste, L. (2013). On the mixing time and spectral gap for birth and death chains. ALEA Lat. Amer. J. Prob. Math. Statist. 10, 293–321.Google Scholar
Diaconis, P. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA.CrossRefGoogle Scholar
Diaconis, P. (1996). The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. USA. 93, 1659–1664.CrossRefGoogle ScholarPubMed
Diaconis, P. and Saloff-Coste, L. (2006). Separation cut-offs for birth and death chains. Ann. Appl. Prob. 16, 2098–2122.CrossRefGoogle Scholar
Ding, J., Lubetzky, E. and Peres, Y. (2010). Total variation cutoff in birth-and-death chains. Prob. Theory Relat. Fields 146, 61–85.CrossRefGoogle Scholar
Horn, R. A. and Johnson, C. R. (1990). Matrix Analysis. Cambridge University Press.Google Scholar
Levin, D. A., Peres, Y. and Wilmer, E. L. (2009). Markov Chains and Mixing Times. American Mathematical Society, Providence, RI.Google Scholar
Saloff-Coste, L. (1997). Lectures on finite Markov chains. In Lectures on Probability Theory and Statistics (St-Flour, 1996; Lecture Notes Math. 1665), Springer, Berlin, pp. 301–413.CrossRefGoogle Scholar