For every graphical degree sequence on n≥4 vertices, the lazy simple-undirected switch chain that proposes switches uniformly on four vertices has total-variation mixing time at distance 1/4 at most 2n⁸.
For every graphical degree sequence on n≥4 vertices, the lazy simple-undirected switch chain that proposes switches uniformly on four vertices has total-variation mixing time at distance 1/4 at most 2n⁸.
For every graphical degree sequence on n≥4 vertices, the lazy simple-undirected switch chain that proposes switches uniformly on four vertices has total-variation mixing time at distance 1/4 at most 2n⁸.
If correct, resolves the simple-undirected Kannan–Tetali–Vempala switch-chain conjecture with an explicit polynomial bound.
Does the switch chain mix in polynomial time for every graphical degree sequence?
Publication dates and editorial changes.
OpenAI reports polynomial mixing of graph switches for every degree sequence
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
