Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
Generating a random permutation with random transpositions
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Explicit growth rates for billiard word complexity in hyperbolic (p,q)-polygons for even q, plus complete grammar rules for realizable paths using minimal tiling paths.
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.
-
Complexity of Billiards in Polygons Associated to Hyperbolic $(p,q)$-Tilings
Explicit growth rates for billiard word complexity in hyperbolic (p,q)-polygons for even q, plus complete grammar rules for realizable paths using minimal tiling paths.
-
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.