Proves cutoff at entropic time log n/h for reversible mixtures of permuted Markov chains under mild assumptions on the base chains.
Cutoff at the entropic time for random walks on covered expander graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Cutoff for mixtures of permuted Markov chains: reversible case
Proves cutoff at entropic time log n/h for reversible mixtures of permuted Markov chains under mild assumptions on the base chains.