# COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS

@article{Diaconis1993COMPARISONTF, title={COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS}, author={Persi Diaconis and Laurent Saloff-Coste}, journal={Annals of Applied Probability}, year={1993}, volume={3}, pages={696-730} }

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 space. This extends the ideas introduced in Diaconis and Saloff-Coste (1993), where random walks on finite groups were considered. The bounds involve geometric properties such as the diameter and covering number of an associated graph along the lines of Diaconis and Stroock (1991). The main…

## 416 Citations

### A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs

- MathematicsElectron. J. Comb.
- 2011

It is proved that the switch chain is rapidly mixing for regular directed graphs of degree $d$, where d is any positive integer-valued function of the number of vertices and the mixing time is bound by bounding the eigenvalues of the chain.

### Cutoff for the Ising model on the lattice

- MathematicsInventiones mathematicae
- 2012

Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising model on lattices. It is well known that at high temperatures, the time it…

### Cutoff for the Ising model on the lattice

- Mathematics
- 2013

Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising model on lattices. It is well known that at high temperatures, the time it…

### General mixing time bounds for finite Markov chains via the absolute spectral gap

- Mathematics
- 2013

We prove an upper bound on the total variation mixing time of a finite Markov chain in terms of the absolute spectral gap and the number of elements in the state space. Unlike results requiring…

### On Markov Chains for Independent Sets

- MathematicsJ. Algorithms
- 2000

A new rapidly mixing Markov chain for independent sets is defined and a polynomial upper bound for the mixing time of the new chain is obtained for a certain range of values of the parameter ?, which is wider than the range for which the mixingTime of the Luby?Vigoda chain is known to be polynomially bounded.

### Geometric inequalities for the eigenvalues of concentrated Markov chains

- MathematicsJournal of Applied Probability
- 2000

This article describes new estimates for the second largest eigenvalue in absolute value of reversible and ergodic Markov chains on finite state spaces. These estimates apply when the stationary…

### Random Walks on Finite Groups

- Mathematics
- 2004

This article gives a general overview of Markov chains on finite sets, and how the structure of a particular class of groups relates to the mixing time of natural random walks on those groups.

### The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results

- Mathematics
- 2002

AbstractWe study a one-dimensional spin (interacting particle) system, with product Bernoulli (p) stationary distribution, in which a site can flip only when its left neighbor is in state +1. Such…

### The asymmetric one-dimensional constrained Ising model

- Mathematics
- 2001

We study a one-dimensional spin (interacting particle) system, with product Bernoulli (p) stationary distribution, in which a site can flip only when its left neighbor is in state +1. Such models…

### Mixing time for the Ising model and random walks

- Mathematics
- 2011

Author(s): Ding, Jian | Advisor(s): Peres, Yuval; Mossel, Elchanan | Abstract: In this thesis we study the mixing times of Markov chains, e.g., therate of convergence of Markov chains to stationary…

## References

SHOWING 1-10 OF 21 REFERENCES

### Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

- Computer ScienceCombinatorics, 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.

### Moderate Growth and Random Walk on Finite Groups

- Mathematics
- 1994

We study the rate of convergence of symmetric random walks on finite groups to the uniform distribution. A notion of moderate growth is introduced that combines with eigenvalue techniques to give…

### Moderate growth and random walk on finite groups

- Mathematics
- 1994

We study the rate of convergence of symmetric random walks on finite groups to the uniform distribution. A notion of moderate growth is introduced that combines with eigenvalue techniques to give…

### Geometric Bounds for Eigenvalues of Markov Chains

- Mathematics
- 1991

We develop bounds for the second largest eigenvalue and spectral gap of a reversible Markov chain. The bounds depend on geometric quantities such as the maximum degree, diameter and covering number…

### Time to reach stationarity in the Bernoulli-Laplace diffusion model

- Mathematics
- 1987

Consider two urns, the left containing n red balls, the right containing n black balls. At each time a ball is chosen at random in each urn and the two balls are switched. We show it takes $\tfrac{1}…

### Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow

- MathematicsLATIN
- 1992

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.

### On the diameter of finite groups

- MathematicsProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
- 1990

It is shown that, although the structure of the group is essentially irrelevant if mod S mod is allowed to exceed (log mod G mod )/sup 1+c/(c>0), it plays a strong role when mod Smod =O(1).

### Quantum Heisenberg ferromagnets and stochastic exclusion processes

- Physics, Mathematics
- 1980

Let H be the isotropic spin‐s quantum ferromagnetic Heisenberg Hamiltonian associated with a finite volume in Zd. In an appropriate representation, the restriction of −H to the N‐spin wave sector −HN…

### An Introduction to Probability Theory and Its Applications

- Mathematics
- 1950

Thank you for reading an introduction to probability theory and its applications vol 2. As you may know, people have look numerous times for their favorite novels like this an introduction to…