A non-local random walk on the hypercube
From MaRDI portal
Publication:5233209
DOI10.1017/apr.2017.42zbMath1423.60111arXiv1507.05690OpenAlexW2964310345MaRDI QIDQ5233209
Publication date: 16 September 2019
Published in: Unnamed Author (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.05690
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Related Items (3)
A spectral decomposition for a simple mutation model ⋮ Mixing time bounds for edge flipping on regular graphs ⋮ A class of random walks on the hypercube
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization algorithms and random walk on the d-cube
- Comparison techniques for random walk on finite groups
- Mixing time of the Rudvalis shuffle
- Hit and run as a unifying device
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- Shuffling Cards and Stopping Times
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- Random Walk and the Theory of Brownian Motion
This page was built for publication: A non-local random walk on the hypercube