Mixing reversible Markov chains in the max-^2-distance
From MaRDI portal
Publication:6634823
DOI10.30757/ALEA.V21-65MaRDI QIDQ6634823FDOQ6634823
Authors: Guan-Yu Chen 
Publication date: 8 November 2024
Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)
Recommendations
- The \(L^{2}\)-cutoffs for reversible Markov chains
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
- The \(L^{2}\)-cutoff for reversible Markov processes
- A technical report on hitting times, mixing and cutoff
- Mixing and hitting times for finite Markov chains
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)
Cites Work
- Equation of state calculations by fast computing machines
- Generating a random permutation with random transpositions
- Title not available (Why is that?)
- Bounds for left and right window cutoffs
- Comparison of cutoffs between lazy walks and Markovian semigroups
- What do we know about the Metropolis algorithm?
- The cutoff phenomenon for ergodic Markov processes
- Separation cut-offs for birth and death chains
- The \(L^{2}\)-cutoff for reversible Markov processes
- Title not available (Why is that?)
- Total variation cutoff in birth-and-death chains
- The \(L^{2}\)-cutoffs for reversible Markov chains
- Characterization of cutoff for reversible Markov chains
- Cutoff at the ``entropic time for sparse Markov chains
- Cutoffs for product chains
- On sensitivity of mixing times and cutoff
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
- Computing cutoff times of birth and death chains
This page was built for publication: Mixing reversible Markov chains in the max-\(\ell^2\)-distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634823)
