Comparing limit profiles of reversible Markov chains
From MaRDI portal
Publication:6545181
Recommendations
Cites work
- scientific article; zbMATH DE number 4082591 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 1981749 (Why is no real title available?)
- A lower bound for the mixing time of the random-to-random insertions shuffle
- A strong uniform time for random transpositions
- Bounds for Kac's master equation
- Comparison techniques for random walk on finite groups
- Comparison theorems for reversible Markov chains
- Cut-off phenomenon in the uniform plane Kac walk
- Cutoff for non-negatively curved Markov chains
- Cutoff for random to random card shuffle
- Cutoff for the Bernoulli-Laplace urn model with \(o(n)\) swaps
- Cutoff on all Ramanujan graphs
- Cutoff profile of ASEP on a segment
- Generating a random permutation with random transpositions
- Generating random elements in \(SL_ n(F_ q)\) by random transvections
- Improved bounds for the mixing time of the random-to-random shuffle
- KAZHDAN CONSTANTS FOR SLn(ℤ)
- Limit profile for random transpositions
- Limit profiles for reversible Markov chains
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On the mixing time of Kac's walk and other high-dimensional Gibbs samplers with constraints
- Random rotations: Characters and random walks on \(SO(N)\)
- Random shuffles and group representations
- Refined estimates for some basic random walks on the symmetric and alternating groups
- The cutoff profile for the simple exclusion process on the circle
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- Trailing the dovetail shuffle to its lair
- Walks on generating sets of Abelian groups
This page was built for publication: Comparing limit profiles of reversible Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545181)