Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
Coupling from the past
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Tempering chains achieve polynomial spectral gap lower bounds of order 11-12 for multimodal Gibbs measures without explicit energy landscape structure.
Proves cutoff at entropic time log n/h for reversible mixtures of permuted Markov chains under mild assumptions on the base chains.
Quantum graphs are presented as a paradigmatic model for quantum chaos, with the paper providing a didactical overview of foundational results and some recent developments.
citing papers explorer
-
Rapid convergence of tempering chains to multimodal Gibbs measures
Tempering chains achieve polynomial spectral gap lower bounds of order 11-12 for multimodal Gibbs measures without explicit energy landscape structure.
-
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.
-
Quantum graph models of quantum chaos: an introduction and some recent applications
Quantum graphs are presented as a paradigmatic model for quantum chaos, with the paper providing a didactical overview of foundational results and some recent developments.