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.
The Electronic Journal of Combinatorics , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral Gap for the Binary Fixed-Margin Swap Chain
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.