Fast mixing of a randomized shift-register Markov chain
From MaRDI portal
Publication:5880997
DOI10.1017/JPR.2022.37OpenAlexW3199500081MaRDI QIDQ5880997FDOQ5880997
Authors: David A. Levin
Publication date: 9 March 2023
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.05387
Recommendations
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Analysis of a nonreversible Markov chain sampler.
- Concentration inequalities. A nonasymptotic theory of independence
- Refinements of lower bounds for polygamma functions
- Random random walks on \(\mathbb{Z}_2^d\)
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- Non-reversible Metropolis-Hastings
- An affine walk on the hypercube
- Lifting Markov chains to speed up mixing
- Hit and run as a unifying device
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Cutoff for a stratified random walk on the hypercube
- Shift Register Sequences
- Speeding up Markov chains with deterministic jumps
Cited In (5)
This page was built for publication: Fast mixing of a randomized shift-register Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880997)