probability-statistics / Markov chain mixing time

Kannan–Tetali–Vempala conjecture (bipartite/binary-matrix case)

The swap chain flips checkerboard 2×2 blocks to sample 0/1 matrices with fixed row and column sums. Kannan, Tetali and Vempala conjectured in 1997 that it mixes in polynomial time for all feasible margins; the lazy chain is shown to have spectral gap at least $\binom{m}{2}^{-1}\binom{n}{2}^{-1}$ on $m \times n$ matrices, which is worst-case tight and settles the bipartite case.

30Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

probability-statisticsJun 21, 2026Significance 30/100Registry: lean verified

Kannan–Tetali–Vempala conjecture (bipartite/binary-matrix case)

Prior state unknownproved

The swap chain flips checkerboard 2×2 blocks to sample 0/1 matrices with fixed row and column sums. Kannan, Tetali and Vempala conjectured in 1997 that it mixes in polynomial time for all feasible margins; the lazy chain is shown to have spectral gap at least $\binom{m}{2}^{-1}\binom{n}{2}^{-1}$ on $m \times n$ matrices, which is worst-case tight and settles the bipartite case.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The swap chain flips checkerboard 2×2 blocks to sample 0/1 matrices with fixed row and column sums. Kannan, Tetali and Vempala conjectured in 1997 that it mixes in polynomial time for all feasible margins; the lazy chain is shown to have spectral gap at least $\binom{m}{2}^{-1}\binom{n}{2}^{-1}$ on $m \times n$ matrices, which is worst-case tight and settles the bipartite case.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.