Abstract
We show that the convergence of finite state space Markov chains to stationarity can often be considerably speeded up by alternating every step of the chain with a deterministic move. Under fairly general conditions, we show that not only do such schemes exist, they are numerous.
This is a preview of subscription content, access via your institution.
Change history
06 September 2021
A Correction to this paper has been published: https://doi.org/10.1007/s00440-021-01049-1
References
Anderson, H.C., Diaconis, P.: Hit and run as a unifying device. J. Soc. Francaise Statist. 148, 5–28 (2007)
Avena, L., Güldaş, H., van der Hofstad, R., den Hollander, F.: Mixing times of random walks on dynamic configuration models. Ann. Appl. Probab. 28(4), 1977–2002 (2018)
Benaïm, M., Le Borgne, S., Malrieu, F., Zitt, P.-A.: Qualitative properties of certain piecewise deterministic Markov processes. Ann. Inst. Henri Poincaré Probab. Stat. 51(3), 1040–1075 (2015)
Boardman, S., Saloff-Coste, L.: The hit-and-run version of top-to-random (2020, in preparation)
Bordenave, C., Lacoin, H.: Cutoff at the entropic time for random walks on covered expander graphs (2018). Preprint arXiv:1812.06769
Bordenave, C., Qiu, Y., Zhang, Y.: Spectral gap of sparse bistochastic matrices with exchangeable rows with application to shuffle-and-fold maps (2018). Preprint arXiv:1805.06205
Breuillard, E., Varjú, P.: Irreducibility of random polynomials of large degree. Acta Math. 223(2), 195–249 (2019)
Breuillard, E., Varjú, P.: Cut-off phenomenon for the ax+b Markov chain over a finite field (2019). Preprint arXiv:1909.09053
Chung, F.R.K., Diaconis, P., Graham, R.L.: Random walks arising in random number generation. Ann. Probab. 15(3), 1148–1165 (1987)
Conchon–Kerjan, G.: Cutoff for random lifts of weighted graphs (2019). Preprint arXiv:1908.02898
Constantin, P., Kiselev, A., Ryzhik, L., Zlatoš, A.: Diffusion and mixing in fluid flow. Ann. Math. (2) 168(2), 643–674 (2008)
Diaconis, P.: Group representations in probability and statistics. Institute of Mathematical Statistics, Hayward, CA (1988)
Diaconis, P.: Some things we’ve learned (about Markov chain Monte Carlo). Bernoulli 19(4), 1294–1305 (2013)
Diaconis, P.: Probabilizing Fibonacci Numbers. Connections in Discrete Mathematics. Cambridge University Press, Cambridge (2018)
Diaconis, P., Graham, R.: An affine walk on the hypercube. Asymptotic methods in analysis and combinatorics. J. Comput. Appl. Math. 41(1–2), 215–235 (1992)
Diaconis, P., Graham, R.: Binomial coefficient codes over GF(2). A collection of contributions in honour of Jack van Lint. Discret. Math. 106/107, 181–188 (1992)
Diaconis, P., Holmes, S., Neal, R.M.: Analysis of a nonreversible Markov chain sampler. Ann. Appl. Probab. 10(3), 726–752 (2000)
Diaconis, P., Miclo, L.: On the spectral analysis of second-order Markov chains. Ann. Fac. Sci. Toulouse Math. (6) 22(3), 573–621 (2013)
Diaconis, P., Saloff-Coste, L.: Moderate growth and random walk on finite groups. Geom. Funct. Anal. 4(1), 1–36 (1994)
Diaconis, P., Shahshahani, M.: Time to reach stationarity in the Bernoulli–Laplace diffusion model. SIAM J. Math. Anal. 18(1), 208–218 (1987)
Diaconis, P., Sturmfels, B.: Algebraic algorithms for sampling from conditional distributions. Ann. Stat. 26(1), 363–397 (1998)
Ding, J., Peres, Y.: Sensitivity of mixing times. Electron. Commun. Probab.18(88), 6 pp (2013)
Eberhard, S., Varjú, P.: Mixing time of the Chung–Diaconis–Graham random process (2020). Preprint arXiv:2003.08117
Ganguly, S., Peres, Y.: Permuted random walk exits typically in linear time. In: ANALCO14—Meeting on Analytic Algorithmics and Combinatorics, pp. 74–81. SIAM, Philadelphia (2014)
Gerencsér, B., Hendrickx, J.M.: Improved mixing rates of directed cycles by added connection. J. Theoret. Probab. 32(2), 684–701 (2019)
Greenhalgh, A.: On a model for random random-walks on finite groups (1990). Unpublished manuscript
Guralnick, R.M., Müller, P.: Exceptional polynomials of affine type. J. Algebra 194(2), 429–454 (1997)
Hermon, J.: On sensitivity of uniform mixing times. Ann. Inst. Henri Poincaré Probab. Stat. 54(1), 234–248 (2018)
Hermon, J., Peres, Y.: On sensitivity of mixing times and cutoff. Electron. J. Probab. 23, Paper No. 25, 34 pp (2018)
Hermon, J., Sly, A., Sousi, P.: Universality of cutoff for quasi-random graphs (2020). Preprint arXiv:2008.08564
Hildebrand, M.: A survey of results on random random walks on finite groups. Probab. Surv. 2, 33–63 (2005)
Hildebrand, M.: A lower bound for the Chung–Diaconis–Graham random process. Proc. Am. Math. Soc. 137(4), 1479–1487 (2009)
Kapfer, S.C., Krauth, W.: Irreversible local Markov chains with rapid convergence towards equilibrium. Phys. Rev. Lett. 119(24), 240603 (2017)
Lubetzky, E., Peres, Y.: Cutoff on all Ramanujan graphs. Geom. Funct. Anal. 26(4), 1190–1216 (2016)
Lubetzky, E., Sly, A.: Cutoff phenomena for random walks on random regular graphs. Duke Math. J. 153(3), 475–510 (2010)
Malrieu, F.: Some simple but challenging Markov processes. Ann. Fac. Sci. Toulouse Math. (6) 24(4), 857–883 (2015)
Neal, R.M.: Improving asymptotic variance of mcmc estimators: non-reversible chains are better (2004). Preprint arXiv:math/0407281
Neville, R., III.: On lower bounds of the Chung–Diaconis–Graham random process. Ph.D. thesis, State University of New York at Albany (2011)
Ottino, J.M.: The Kinematics of Mixing: Stretching, Chaos, and Transport. Cambridge University Press, Cambridge (1989)
Pymar, R., Sousi, P.: A permuted random walk exits faster. ALEA Lat. Am. J. Probab. Math. Stat. 11(1), 185–195 (2014)
Rallabandi, B., Wang, C., Hilgenfeldt, S.: Analysis of optimal mixing in open-flow mixers with time-modulated vortex arrays. Phys. Rev. Fluids 2(6), 064501 (2017)
Wilson, D.B.: Random random walks on \({\mathbb{Z}}_2^d\). Probab. Theory Related Fields 108(4), 441–457 (1997)
Acknowledgements
We thank Shirshendu Ganguly for bringing the paper [24] to our attention, which was crucial for the proof of Theorem 2.2. We thank Kannan Soundararajan, Perla Sousi, Ron Graham, Fan Chung, Charles Bordenave, Jimmy He, Huy Pham, and especially Jonathan Hermon for many insightful comments and references. Lastly, we thank the referee for a number of useful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
In memory of Harry Kesten.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Sourav Chatterjee’s research was partially supported by NSF Grant DMS-1855484. Persi Diaconis’s research was partially supported by NSF Grant DMS-1954042. Data availability statement: Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
Rights and permissions
About this article
Cite this article
Chatterjee, S., Diaconis, P. Speeding up Markov chains with deterministic jumps. Probab. Theory Relat. Fields 178, 1193–1214 (2020). https://doi.org/10.1007/s00440-020-01006-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-020-01006-4
Keywords
- Markov chain
- Mixing time
- Spectral gap
- Cheeger constant
Mathematics Subject Classification
- 60J10
- 60J22