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)

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
Random generators of the symmetric group: diameter, mixing time and spectral gap.
Cutoff phenomenon for nearest Lamperti's random walk
Quantifying the Dissipation Enhancement of Cellular Flows
Quenched scaling limits of trap models
Increasing subsequences of random walks
Cover times and generic chaining
Delay performance in random-access networks
The \(L^{2}\)-cutoff for reversible Markov processes
Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
Transport-entropy inequalities and curvature in discrete-space Markov chains
Harmonic functions of linear growth on solvable groups
The mixing time of a random walk on a long-range percolation cluster in pre-Sierpinski gasket
The worm process for the Ising model is rapidly mixing
Cutoff for the Fredrickson-Andersen one spin facilitated model
Functions of random walks on hyperplane arrangements
Biased random walk on critical Galton-Watson trees conditioned to survive
Exponential and double exponential tails for maximum of two-dimensional discrete Gaussian free field
Harmonic maps on amenable groups and a diffusive lower bound for random walks
Detection thresholds in very sparse matrix completion
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Slow movement of a random walk on the range of a random walk in the presence of an external field
Mixing times of monotone surfaces and SOS interfaces: a mean curvature approach
Optimal eviction policies for stochastic address traces
Measuring bias in cyclic random walks
Convergence rates of Markov chains on spaces of partitions
Skip-free Markov chains
Information geometry of reversible Markov chains
Cutoff for random to random card shuffle
The random \((n-k)\)-cycle to transpositions walk on the symmetric group
A natural diffusion distance and equivalence of local convergence and local equicontinuity for a general symmetric diffusion semigroup
Self-stabilizing repeated balls-into-bins
The quality of genetic code models in terms of their robustness against point mutations
The mixing time for a random walk on the symmetric group generated by random involutions
Quantum algorithm design: techniques and applications
Hybrid models of opinion dynamics with opinion-dependent connectivity
Asymptotic properties of the maximum likelihood estimator in regime switching econometric models
Improved mixing rates of directed cycles by added connection
Metastable Markov chains: from the convergence of the trace to the convergence of the finite-dimensional distributions
Return probability and recurrence for the random walk driven by two-dimensional Gaussian free field
Linear time average consensus and distributed optimization on fixed graphs
Capacity of the range of random walk on \(\mathbb {Z}^d\)
A new approach to Laplacian solvers and flow problems
Logical limit laws for minor-closed classes of graphs
Decomposition of quantum Markov chains and its applications
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
Hitting time and mixing time bounds of Stein's factors
Excited random walk in a Markovian environment
An exercise(?) in Fourier analysis on the Heisenberg group
Combinatorics of a disordered two-species ASEP on a torus
Bayesian computation: a summary of the current state, and samples backwards and forwards
Correlations in the multispecies TASEP and a conjecture by Lam
Compositional strategy synthesis for stochastic games with multiple objectives
Bumping sequences and multispecies juggling
Extinction times in the subcritical stochastic SIS logistic epidemic
Rigorous results for the Stigler-Luckock model for the evolution of an order book
Cutoff for lamplighter chains on fractals
A general selective averaging method for piecewise constant signal and image processing
Cutoff for a stratified random walk on the hypercube
When is a scale-free graph ultra-small?
Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
Geometric juggling with \(q\)-analogues
A zero-one law for recurrence and transience of frog processes
Speed of random walks, isoperimetry and compression of finitely generated groups
Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
The value of real time yield information in multi-stage inventory systems -- exact and heuristic approaches
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

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)