On Hitting Time, Mixing Time and Geometric Interpretations of Metropolis–Hastings Reversiblizations
- 16 Downloads
Given a target distribution \(\mu \) and a proposal chain with generator Q on a finite state space, in this paper, we study two types of Metropolis–Hastings (MH) generator \(M_1(Q,\mu )\) and \(M_2(Q,\mu )\) in a continuous-time setting. While \(M_1\) is the classical MH generator, we define a new generator \(M_2\) that captures the opposite movement of \(M_1\) and provide a comprehensive suite of comparison results ranging from hitting time and mixing time to asymptotic variance, large deviations and capacity, which demonstrate that \(M_2\) enjoys superior mixing properties than \(M_1\). To see that \(M_1\) and \(M_2\) are natural transformations, we offer an interesting geometric interpretation of \(M_1\), \(M_2\) and their convex combinations as \(\ell ^1\) minimizers between Q and the set of \(\mu \)-reversible generators, extending the results by Billera and Diaconis (Stat Sci 16(4):335–339, 2001). We provide two examples as illustrations. In the first one, we give explicit spectral analysis of \(M_1\) and \(M_2\) for Metropolized independent sampling, while in the second example, we prove a Laplace transform order of the fastest strong stationary time between birth–death \(M_1\) and \(M_2\).
KeywordsMarkov chains Metropolis–Hastings algorithm Additive reversiblization Hitting time Mixing time Asymptotic variance Large deviations
Mathematics Subject Classification (2010)60J27 60J28
The authors would like to thank the anonymous referee for constructive comments that improved the presentation of the manuscript. Michael Choi acknowledges support from the Chinese University of Hong Kong, Shenzhen grant PF01001143. Lu-Jing Huang acknowledges support from NSFC No. 11771047 and Probability and Statistics: Theory and Application (IRTL1704). The authors would also like to thank Professor Yong-Hua Mao for his hospitality during their visit to Beijing Normal University, where this work was initiated.
- 1.Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs, 2002. Unfinished Monograph, Recompiled. http://www.stat.berkeley.edu/~aldous/RWG/book.html (2014)
- 4.Chen, F., Lovász, L., Pak, I.: Lifting Markov chains to speed up mixing. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 275–281 (1999)Google Scholar
- 8.Choi, M.C.: Metropolis–Hastings reversiblizations of non-reversible Markov chains. arXiv:1706.00068 (2017)
- 10.den Hollander, F.: Large Deviations, Volume 14 of Fields Institute Monographs. American Mathematical Society, Providence, RI (2000)Google Scholar
- 14.Doyle, P.-G.: Energy for Markov Chains. http://www.math.dartmouth.edu/doyle (1994)
- 20.Huang, L.-J., Mao, Y.-H.: Dirichlet principles for asymptotic variance of markov chains. (preprint)Google Scholar
- 24.Komorowski, T., Landim, C., Olla, S.: Fluctuations in Markov Processes, Volume 345 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Heidelberg (2012)Google Scholar
- 27.Liu, J.S.: Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Stat Comput 6(2), 113–119 (1996)Google Scholar
- 29.Metropolis, N., Rosenbluth, A.-W., Rosenbluth, M.-N., Teller, A.-H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)Google Scholar
- 34.Sun, Y., Gomez, F., Schmidhuber, J.: Improving the asymptotic performance of Markov chain Monte-Carlo by inserting vortices. In: NIPS, USA, pp. 2235–2243 (2010)Google Scholar