Proves spectral gap lower bound of binom(m,2)^{-1} binom(n,2)^{-1} for the lazy swap chain on m by n binary matrices with arbitrary feasible margins, resolving the Kannan-Tetali-Vempala conjecture.
Coupling from the past
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.
Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
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
-
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.