Some Inequalities for Reversible Markov Chains

DOI10.1112/JLMS/S2-25.3.564MaRDI QIDQ3951346zbMATH OpenOpenAlexFDO

Authors David 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 timesreversible chainsstationary distribution

Mathematics Subject Classification ID

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

Cited in

(36)

• Meeting times for independent Markov chains
• A rapidly mixing stochastic system of finite interacting particles on the circle
• Hitting time and mixing time bounds of Stein's factors
• Mixing time bounds via bottleneck sequences
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Mixing times for uniformly ergodic Markov chains
• 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
• Some inequalities for reversible Markov chains and branching random walks via spectral optimization
• The toom interface via coupling
• A spectral characterization for concentration of the cover time
• A comparison principle for random walk on dynamical percolation
• Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
• Quenched localisation in the Bouchaud trap model with slowly varying traps
• Fast perfect sampling from linear extensions
• Systematic scan for sampling colorings
• The mixing time of the giant component of a random graph
• The mixing time of Glauber dynamics for coloring regular trees
• Tight inequalities among set hitting times in Markov chains
• The Quantum Complexity of Markov Chain Monte Carlo
• Self-intersections of random walks on discrete groups
• Interacting particle systems as stochastic social dynamics
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• On mixing times for stratified walks on thed-cube
• A technical report on hitting times, mixing and cutoff
• Mixing times are hitting times of large sets
• Quantum mixing of Markov chains for special distributions
• Mean unknotting times of random knots and embeddings
• Perfect Simulation for Image Restoration
• Dobrushin Conditions and Systematic Scan
• 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
• Cutoff on trees is rare
• Sensitivity of mixing times of Cayley graphs
• Mixing times of a Burnside process Markov chain on set partitions
• Faster mixing and small bottlenecks

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

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