Some Inequalities for Reversible Markov Chains

DOI10.1112/jlms/s2-25.3.564zbMath0489.60077OpenAlexW1989466175MaRDI QIDQ3951346

David J. Aldous

Publication date: 1982

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-25.3.564

zbMATH Keywords

hitting timesstationary distributionreversible chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (33)

Quenched localisation in the Bouchaud trap model with slowly varying traps ⋮ Fast perfect sampling from linear extensions ⋮ On mixing times for stratified walks on thed-cube ⋮ Tight inequalities among set hitting times in Markov chains ⋮ Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ Faster mixing and small bottlenecks ⋮ Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow ⋮ The mixing time of the giant component of a random graph ⋮ Interacting particle systems as stochastic social dynamics ⋮ The toom interface via coupling ⋮ A rapidly mixing stochastic system of finite interacting particles on the circle ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Improvement of quantum walks search algorithm in single-marked vertex graph ⋮ The Quantum Complexity of Markov Chain Monte Carlo ⋮ A spectral characterization for concentration of the cover time ⋮ A comparison principle for random walk on dynamical percolation ⋮ The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. ⋮ Mixing times for uniformly ergodic Markov chains ⋮ Meeting times for independent Markov chains ⋮ Quantum mixing of Markov chains for special distributions ⋮ Mixing times are hitting times of large sets ⋮ Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms ⋮ Hitting time and mixing time bounds of Stein's factors ⋮ Metastable Markov chains: from the convergence of the trace to the convergence of the finite-dimensional distributions ⋮ Hitting, mixing and tunneling asymptotics of Metropolis-Hastings reversiblizations in the low-temperature regime ⋮ Mixing time bounds via bottleneck sequences ⋮ Perfect Simulation for Image Restoration ⋮ Systematic scan for sampling colorings ⋮ The mixing time of Glauber dynamics for coloring regular trees ⋮ A technical report on hitting times, mixing and cutoff ⋮ Dobrushin Conditions and Systematic Scan ⋮ Mean unknotting times of random knots and embeddings ⋮ Self-intersections of random walks on discrete groups

This page was built for publication: Some Inequalities for Reversible Markov Chains