Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.PR 2representative citing papers
Proves cutoff at entropic time log n/h for reversible mixtures of permuted Markov chains under mild assumptions on the base chains.
citing papers explorer
-
Nonconcentration of hitting times for random walks on graphs
Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
-
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.