Comparison inequalities and fastest-mixing Markov chains
From MaRDI portal
Publication:373832
DOI10.1214/12-AAP886zbMath1288.60089arXiv1109.6075OpenAlexW3105460891MaRDI QIDQ373832
Publication date: 25 October 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6075
Markov chainslog-concave distributionsbirth-and-death chainscomparison inequalitiesfastest mixingstochastic monotonicity
Related Items (9)
Monte Carlo Markov chains constrained on graphs for a target with disconnected support ⋮ Monotonicity for continuous-time random walks ⋮ Geometric bounds on the fastest mixing Markov chain ⋮ Unnamed Item ⋮ Comparison of hit-and-run, slice sampler and random walk Metropolis ⋮ Strong stationary duality for diffusion processes ⋮ Existence condition of strong stationary times for continuous time Markov chains on discrete graphs ⋮ Stochastic orderings of multivariate elliptical distributions ⋮ Variational formulas for asymptotic variance of general discrete-time Markov chains
Cites Work
- Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities
- Some circumstances where extra updates can delay mixing
- Strong stationary times via a new form of duality
- Merging for time inhomogeneous finite Markov chains. I: Singular values and stability
- Strong uniform times and finite random walks
- Bounds on the coarseness of random sums
- An interruptible algorithm for perfect sampling via Markov chains
- Comparison theorems for reversible Markov chains
- Time inhomogeneous Markov chains with wave-like behavior
- Convergence of some time inhomogeneous Markov chains via spectral techniques
- Bounding fastest mixing
- Time to Stationarity for a Continuous-Time Markov Chain
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Fastest Mixing Markov Chain on Graphs with Symmetries
- Proof of Aldous’ spectral gap conjecture
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Fastest Mixing Markov Chain on a Graph
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Absolute algebraic connectivity of trees
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Fastest Mixing Markov Chain on a Path
- Inequalities: theory of majorization and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Comparison inequalities and fastest-mixing Markov chains
