Fast mixing of a randomized shift-register Markov chain
From MaRDI portal
Publication:5880997
Recommendations
Cites work
- An affine walk on the hypercube
- Analysis of a nonreversible Markov chain sampler.
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- Concentration inequalities. A nonasymptotic theory of independence
- Cutoff for a stratified random walk on the hypercube
- Hit and run as a unifying device
- Lifting Markov chains to speed up mixing
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Non-reversible Metropolis-Hastings
- Random random walks on \(\mathbb{Z}_2^d\)
- Refinements of lower bounds for polygamma functions
- 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)