Mixing reversible Markov chains in the max-^2-distance
From MaRDI portal
Publication:6634823
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
Cites work
- scientific article; zbMATH DE number 431548 (Why is no real title available?)
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
- Bounds for left and right window cutoffs
- Characterization of cutoff for reversible Markov chains
- Comparison of cutoffs between lazy walks and Markovian semigroups
- Computing cutoff times of birth and death chains
- Cutoff at the ``entropic time for sparse Markov chains
- Cutoffs for product chains
- Equation of state calculations by fast computing machines
- Generating a random permutation with random transpositions
- On sensitivity of mixing times and cutoff
- Separation cut-offs for birth and death chains
- The \(L^{2}\)-cutoff for reversible Markov processes
- The \(L^{2}\)-cutoffs for reversible Markov chains
- The cutoff phenomenon for ergodic Markov processes
- Total variation cutoff in birth-and-death chains
- What do we know about the Metropolis algorithm?
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)
