• Corpus ID: 433545

The Markov chain Monte Carlo method: an approach to approximate counting and integration

  title={The Markov chain Monte Carlo method: an approach to approximate counting and integration},
  author={Mark Jerrum and Alistair Sinclair},
In the area of statistical physics, Monte Carlo algorithms based on Markov chain simulation have been in use for many years. The validity of these algorithms depends crucially on the rate of convergence to equilibrium of the Markov chain being simulated. Unfortunately, the classical theory of stochastic processes hardly touches on the sort of non-asymptotic analysis required in this application. As a consequence, it had previously not been possible to make useful, mathematically rigorous… 

Figures from this paper

Mathematical Foundations of the Markov Chain Monte Carlo Method
The Markov chain Monte Carlo method, which exploits the idea that information about a set of combinatorial objects may be obtained by performing an appropriately defined random walk, is used for estimating various quantities of physical interest.
Counting without sampling: new algorithms for enumeration problems using statistical physics
A new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth, inspired by recent developments in statistical physics in connection with correlation decay properties of Gibbs measures.
Mathematical Aspects of Mixing Times in Markov Chains
The strength of the main techniques are illustrated by way of simple examples, a recent result on the Pollard Rho random walk to compute the discrete logarithm, as well as with an improved analysis of the Thorp shuffle.
Sequential stratified splitting for efficient Monte Carlo integration
This article introduces a novel sequential Monte Carlo algorithm called stratified splitting that provides unbiased estimates and can handle various integrand types including indicator functions, which are important for rare-event probability estimation problems.
Canonical Paths for MCMC: from Art to Science
The task of designing canonical paths for MCMC is reduced to solving a set of linear equations, which can be automatically done even by a machine, and fully polynomial-time randomized approximation schemes (FPRAS) for counting the number of b-matching with b ≤ 7 and b-edge-cover with b ≥ 2 are obtained.
Stratified Splitting for Efficient Monte Carlo Integration
The Stratified Splitting method is introduced which provides unbiased estimates and can handle various integrand types including indicator functions, which are used in rare-event probability estimation problems and achieves a rigorous efficiency guarantee in terms of the required sample size.
Rapid mixing through decomposition and induction
The thesis concludes with the treatment of a novel decomposition method and its application to bounding the convergence rate of a random process on finite, complete d-ary trees.
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
A deterministic sampling algorithm based on deterministic random walk, such as the rotor-router model (a.k.a. Propp machine) is proposed, which provides samples with a “distribution” with a point-wise distance at most e from the target distribution, in time polynomial in the input size and e − 1.
Discrete Equilibrium Sampling with Arbitrary Nonequilibrium Processes
The experiments on various Ising models suggest that state space sampling enables heuristic state generation with accurate probability estimates, demonstrated by illustrating the convergence of a simulated annealing process to the Boltzmann distribution with increasing run length.
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians
This work rigorously justifies the use of PIMC to approximate partition functions and expectations of observables for 1D stoquastic Hamiltonians, including disordered transverse Ising models (TIM) with long-range algebraically decaying interactions as well as disordered XY spin chains with nearest-neighbor interactions.


Exact sampling with coupled Markov chains and applications to statistical mechanics
This work describes a simple variant of this method that determines on its own when to stop and that outputs samples in exact accordance with the desired distribution, and uses couplings which have also played a role in other sampling schemes.
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
  • A. Sinclair
  • Computer Science
    Combinatorics, Probability and Computing
  • 1992
A new upper bound on the mixing rate is presented, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph, and improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system.
On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
Uniform distributions on complicated combinatorial sets can be simulated by the Markov chain method. A condition is given for the simulations to be accurate in polynomial time. Similar analysis of
Randomised algorithms for counting and generating combinatorial structures
The thesis studies the computational complexity of two natural classes of combinatorial problems: counting the elements of a finite set of structures and generating them uniformly at random. For each
New Monte Carlo method for the self-avoiding walk
We introduce a new Monte Carlo algorithm for the self-avoiding walk (SAW), and show that it is particularly efficient in the critical region (long chains). We also introduce new and more efficient
Approximating the number of monomer-dimer coverings of a lattice
This paper presents the first provably polynomial-time approximation algorithms for computing the number of coverings with any specified number of monomers ind-dimensional rectangular lattice with periodic boundaries, for any fixed dimensiond, and in two-dimensional lattices with fixed boundaries.
Approximating the Permanent
A randomised approximation scheme for the permanent of a 0–1s presented, demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely c...
By symmetry, P has eigenvalues 1 = I03 > I381 > ?> I 31xI- 1 2 -1. This paper develops methods for getting upper and lower bounds on 8i3 by comparison with a second reversible chain on the same state
A Chernoff bound for random walks on expander graphs
The method of taking the sample average from one trajectory is a more efficient estimate of /spl pi/(A) than the standard method of generating independent sample points from several trajectories and improves the algorithms of Jerrum and Sinclair (1989) for approximating the number of perfect matchings in a dense graph.
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow
In this paper, Markov chain simulation is applied to the random sampling of combinatorial structures from a specified probability distribution, which lies at the heart of efficient probabilistic algorithms for a wide variety of problems, such as approximating the size of combinatorsially defined sets.