Cutoffs for product chains
From MaRDI portal
Publication:1615913
DOI10.1016/j.spa.2018.01.002zbMath1409.60106arXiv1701.06665OpenAlexW2580834959MaRDI QIDQ1615913
Publication date: 31 October 2018
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.06665
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (3)
Unnamed Item ⋮ Products of random walks on finite groups with moderate growth ⋮ Convergences of the rescaled Whittaker stochastic differential equations and independent sums
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cut-off for \(n\)-tuples of exponentially converging processes
- The cutoff phenomenon for ergodic Markov processes
- The \(L^{2}\)-cutoffs for reversible Markov chains
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- The \(L^{2}\)-cutoff for reversible Markov processes
- Products of random walks on finite groups with moderate growth
- Cut-off for large sums of graphs
- A product chain without cutoff
- On equivalence of infinite product measures
- Bounds for left and right window cutoffs
- Cutoff for samples of Markov chains
- The cutoff phenomenon in finite Markov chains.
- Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
This page was built for publication: Cutoffs for product chains