Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

zbMATH Open1160.60001MaRDI QIDQ3549475FDOQ3549475

Authors: David A. Levin, Yuval Peres, Elizabeth L. Wilmer

Publication date: 29 December 2008

Recommendations

Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
scientific article; zbMATH DE number 1195779
scientific article; zbMATH DE number 1426485
Markov Chains
From shuffling cards to walking around the building: An introduction to modern Markov chain theory

Markov chain Monte Carlo Markov chains coupling hitting times Ising model mixing times

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01)

Cited In (only showing first 100 items - show all)

Random walk on random planar maps: spectral dimension, resistance and displacement
Metastability in a condensing zero-range process in the thermodynamic limit
Unbiased diffusion of Brownian particles on disordered correlated potentials
Mixing time for random walk on supercritical dynamical percolation
Local picture and level-set percolation of the Gaussian free field on a large discrete torus
A particle system with cooperative branching and coalescence
Exact solution for a class of random walk on the hypercube
Weighted exponential random graph models: scope and large network limits
Random walks on binary strings applied to the somatic hypermutation of B-cells
A Gibbs sampler on the \(n\)-simplex
Critical window for the vacant set left by random walk on the configuration model
Phase transitions in random dyadic tilings and rectangular dissections
Stochastic minority on graphs
Relaxation time is monotone in temperature in the mean-field Ising model
Cut-off for lamplighter chains on tori: dimension interpolation and phase transition
Monotonicity and condensation in homogeneous stochastic particle systems
\(H\)-coloring tori
Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
Birkhoff sum fluctuations in substitution dynamical systems
Equilibrium and non-equilibrium Ising models by means of PCA
On unfair permutations
Unlacing hypercube percolation: a survey
Quantum Gibbs samplers: the commuting case
The internal branch lengths of the Kingman coalescent
Stability of local quantum dissipative systems
Branching processes with interactions: subcritical cooperative regime
Exact computation for meeting times and infection times of random walks on graphs
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
A class of random walks on the hypercube
Stein's method for stationary distributions of Markov chains and application to Ising models
A probabilistic mechanism for quark confinement
Mixing time of the card-cyclic-to-random shuffle
Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
Regularity of the speed of biased random walk in a one-dimensional percolation model
Directed nonabelian sandpile models on trees
Nonparametric statistical inference for the context tree of a stationary ergodic process
Convergence theorems of estimation of distribution algorithms
Extinction window of mean field branching annihilating random walk
Mixing times for the mean-field Blume-Capel model via aggregate path coupling
Perfect matchings as IID factors on non-amenable groups
Comparison of contraction coefficients for \(f\)-divergences
Diameter and stationary distribution of random \(r\)-out digraphs
Blocking duality for \(p\)-modulus on networks and applications
Rapid mixing of Glauber dynamics of Gibbs ensembles via aggregate path coupling and large deviations methods
Poincaré, modified logarithmic Sobolev and isoperimetric inequalities for Markov chains with non-negative Ricci curvature
On resistance distance of Markov chain and its sum rules
Small subgraphs in the trace of a random walk
Mixing of the exclusion process with small bias
Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
The scaling limit for zero-temperature planar Ising droplets: with and without magnetic fields
Sampling the Fermi statistics and other conditional product measures
Limit profile for random transpositions
Lower bounds to the spectral gap of Davies generators
Synchronization of networked harmonic oscillators subject to Markovian jumping coupling strengths
Stochastic variational inference for large-scale discrete choice models using adaptive batch sizes
Pathwise duals of monotone and additive Markov processes
Cutoff for a stratified random walk on the hypercube
Spectral gap estimates in mean field spin glasses
On the dynamics of random neuronal networks
The geometric distribution of Selmer groups of elliptic curves over function fields
Unified theory for finite Markov chains
Metastability of the Potts ferromagnet on random regular graphs
An economic model of friendship and enmity for measuring social balance in networks
Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview
On the mixing time of the flip walk on triangulations of the sphere
Convergence of discrete Green functions with Neumann boundary conditions
The evolution of a spatial stochastic network
On the mixing time of the 2D stochastic Ising model with ``Plus boundary conditions at low temperature
Cutoff phenomenon for random walks on Kneser graphs
The mathematics of mixing things up
Rapid mixing of Swendsen-Wang dynamics in two dimensions
Existence of the harmonic measure for random walks on graphs and in random environments
Hypercube percolation
Front evolution of the Fredrickson-Andersen one spin facilitated model
Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
Cutoff for the East process
Exact thresholds for Ising-Gibbs samplers on general graphs
Mixing time for the Ising model: a uniform lower bound for all graphs
A one-dimensional coagulation-fragmentation process with a dynamical phase transition
A sharp estimate for cover times on binary trees
Mixing time of near-critical random graphs
Phase separation in random cluster models. II: The droplet at equilibrium, and local deviation lower bounds
Front progression in the east model
Mixing time for the solid-on-solid model
The cutoff phenomenon for Ehrenfest chains
Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
Condensation in stochastic particle systems with stationary product measures
Tight inequalities among set hitting times in Markov chains
A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
Growing in time IDLA cluster is recurrent
Glauber dynamics for the quantum Ising model in a transverse field on a regular tree
Sampling different kinds of acyclic automata using Markov chains
Quasi-polynomial mixing of the 2D stochastic Ising model with ``plus boundary up to criticality
Total variation bound for Kac's random walk
Clustering in block Markov chains
The speed of critically biased random walk in a one-dimensional percolation model
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm
On the effective impedance of finite and infinite networks
Growth in groups: ideas and perspectives
Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees

This page was built for publication: Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549475)