Lifting Markov chains to speed up mixing
From MaRDI portal
Publication:2819554
DOI10.1145/301250.301315zbMATH Open1345.60075OpenAlexW1985215886MaRDI QIDQ2819554FDOQ2819554
Igor Pak, László Lovász, Fang Chen
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301315
Recommendations
- Bounds on lifting continuous-state Markov chains to speed up mixing
- Characterizing limits and opportunities in speeding up Markov chain mixing
- scientific article; zbMATH DE number 18982
- scientific article; zbMATH DE number 1789923
- Fast mixing of a randomized shift-register Markov chain
- Algorithms and Computation
- Fastest Mixing Markov Chain on a Path
- Rapid mixing and Markov bases
- Fastest Mixing Markov Chain on a Graph
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cited In (27)
- An asymptotic Peskun ordering and its application to lifted samplers
- Analysis of a nonreversible Markov chain sampler.
- Fast mixing of a randomized shift-register Markov chain
- Approximate lumpability for Markovian agent-based models using local symmetries
- On hitting time, mixing time and geometric interpretations of Metropolis-Hastings reversiblizations
- Rapid mixing and Markov bases
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler
- Markov chain mixing time on cycles
- Non-reversible Metropolis-Hastings
- Characterizing limits and opportunities in speeding up Markov chain mixing
- Forward Event-Chain Monte Carlo: Fast Sampling by Randomness Control in Irreversible Markov Chains
- Diameters of symmetric and lifted simple exclusion models
- Robust Mixing
- Using Bernoulli maps to accelerate mixing of a random walk on the torus
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- Lifting Markov Chains to Random Walks on Groups
- Acceleration of convergence to equilibrium in Markov chains by breaking detailed balance
- Irreversible samplers from jump and continuous Markov processes
- Lifting for Simplicity: Concise Descriptions of Convex Sets
- Bounds on lifting continuous-state Markov chains to speed up mixing
- Nonreversible Jump Algorithms for Bayesian Nested Model Selection
- Quantum mixing of Markov chains for special distributions
- Some things we've learned (about Markov chain Monte Carlo)
- On the convergence time of some non-reversible Markov chain Monte Carlo methods
- Sparse hard-disk packings and local Markov chains
- Irreversible Monte Carlo algorithms for efficient sampling
- Improved estimation of relaxation time in nonreversible Markov chains
This page was built for publication: Lifting Markov chains to speed up mixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819554)