Comparison theory for Markov chains on different state spaces and application to random walk on derangements
From MaRDI portal
Publication:904703
DOI10.1007/s10959-014-0559-7zbMath1330.60085arXiv1301.7357OpenAlexW2072447553MaRDI QIDQ904703
Publication date: 13 January 2016
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.7357
Sums of independent random variables; random walks (60G50) Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (3)
Efficient generation of random derangements with the expected distribution of cycle lengths ⋮ Mixing time of fractional random walk on finite fields ⋮ Mixing times for a constrained Ising process on the two-dimensional torus at low density
Cites Work
- Unnamed Item
- Unnamed Item
- Nash inequalities for finite Markov chains
- Mixing time bounds via the spectral profile
- Markov chain comparison
- Walks on generating sets of groups
- Logarithmic Sobolev inequality for some models of random walks
- Comparison theorems for reversible Markov chains
- Comparison techniques for random walk on finite groups
- Moderate growth and random walk on finite groups
- Logarithmic Sobolev inequalities and stochastic Ising models
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Walks on generating sets of Abelian groups
- A random walk on the rook placements on a Ferrers board
- Logarithmic Sobolev inequalities for finite Markov chains
- On the precision of the spectral profile
- Matrix Analysis
- Equation of State Calculations by Fast Computing Machines
- Statistical problems involving permutations with restricted positions
- On the stability of the behavior of random walks on groups
This page was built for publication: Comparison theory for Markov chains on different state spaces and application to random walk on derangements
