Convergence Bounds for Monte Carlo Markov Chains
Abstract: This review paper, written for the second edition of the Handbook of Markov Chain Monte Carlo, provides an introduction to the study of convergence analysis for Markov chain Monte Carlo (MCMC), aimed at researchers new to the field. We focus on methods for constructing bounds on the distance between the distribution of a Markov chain at a given time and its stationary distribution. Two widely-used approaches are explored: the coupling method and the L2 theory of Markov chains. For the latter, we emphasize techniques based on conductance and isoperimetric inequalities. Additionally, we briefly discuss strategies for identifying slow convergence in Markov chains.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.