Correction to: ``Speeding up Markov chains with deterministic jumps

DOI10.1007/s00440-021-01049-1zbMath1474.60178OpenAlexW3196822371MaRDI QIDQ2052703

Sourav Chatterjee, Persi Diaconis

Publication date: 26 November 2021

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00440-021-01049-1

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Random walks on regular trees can not be slowed down, Accelerating abelian random walks with hyperbolic dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Cutoff on all Ramanujan graphs
• Some things we've learned (about Markov chain Monte Carlo)
• Qualitative properties of certain piecewise deterministic Markov processes
• Sensitivity of mixing times
• A survey of results on random random walks on finite groups
• Cutoff phenomena for random walks on random regular graphs
• Random walks arising in random number generation
• An affine walk on the hypercube
• Binomial coefficient codes over GF(2)
• Moderate growth and random walk on finite groups
• Exceptional polynomials of affine type
• Random random walks on \(\mathbb{Z}_2^d\)
• Mixing times of random walks on dynamic configuration models
• On sensitivity of uniform mixing times
• Improved mixing rates of directed cycles by added connection
• On sensitivity of mixing times and cutoff
• Algebraic algorithms for sampling from conditional distributions
• Analysis of a nonreversible Markov chain sampler.
• Hit and run as a unifying device
• Irreducibility of random polynomials of large degree
• Diffusion and mixing in fluid flow
• On the spectral analysis of second-order Markov chains
• Mixing time of the Chung-Diaconis-Graham random process
• A Model for Random Random-Walks on Finite Groups
• A lower bound for the Chung-Diaconis-Graham random process
• Probabilizing Fibonacci Numbers
• Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
• Permuted Random Walk Exits Typically in Linear Time
• A permuted random walk exits faster
• Some simple but challenging Markov processes