Skip to main content Accessibility help
×
Home
Hostname: page-component-56f9d74cfd-h5t46 Total loading time: 0.241 Render date: 2022-06-26T18:42:09.914Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups

Published online by Cambridge University Press:  30 January 2018

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

HTML view is 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.

Type
Research Article
Copyright
© Applied Probability Trust 

References

Aldous, D. and Diaconis, P. (1987). Strong uniform times and finite random walks. Adv. Appl. Math. 8, 6997.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, 6974.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, 2678.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, 293321.Google Scholar
Diaconis, P. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA.Google Scholar
Diaconis, P. (1996). The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. USA. 93, 16591664.CrossRefGoogle Scholar
Diaconis, P. and Saloff-Coste, L. (2006). Separation cut-offs for birth and death chains. Ann. Appl. Prob. 16, 20982122.CrossRefGoogle Scholar
Ding, J., Lubetzky, E. and Peres, Y. (2010). Total variation cutoff in birth-and-death chains. Prob. Theory Relat. Fields 146, 6185.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. 301413.CrossRefGoogle Scholar
You have Access
9
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *