Fast mixing of a randomized shift-register Markov chain

DOI10.1017/JPR.2022.37OpenAlexW3199500081MaRDI QIDQ5880997FDOQ5880997

Author name not available (Why is that?), 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

• The rapid mixing of random walks defined by an \(n\)-cube
• A non-local random walk on the hypercube
• Cutoff for a stratified random walk on the hypercube
• Cutoff for a stratified random walk on the hypercube
• scientific article; zbMATH DE number 18982

zbMATH Keywords

cutoffhypercubeMarkov chainsfast mixing

Mathematics Subject Classification ID

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.
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Cutoff for a stratified random walk on the hypercube
• Shift Register Sequences
• Speeding up Markov chains with deterministic jumps

Cited In (4)

• Title not available (Why is that?)
• Cutoff for permuted Markov chains
• Lifting Markov chains to speed up mixing
• Rapid mixing and Markov bases

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)