The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
Micha Christoph, Sahar Diskin, Lyuben Lichev, Benny Sudakov

TL;DR
This paper proves that the graph of a random 0/1 polytope typically has strong edge-expansion proportional to dimension d, confirming the Mihail-Vazirani conjecture for such polytopes and revealing a phase transition at p=1/2.
Contribution
It establishes the high-probability edge-expansion bounds for random 0/1 polytopes, improving previous results and confirming the Mihail-Vazirani conjecture in this setting.
Findings
Graph of P^d_p has edge-expansion Θ(d) for p in (0,1-ε]
Expansion behavior changes drastically at p=1/2
Phase transition at p=1/2 in expansion properties
Abstract
We study the edge-expansion of the graph of a random polytope , defined as the convex hull of a random subset of the points in where every point is retained independently and with probability . This problem was introduced more than twenty years ago in a work of Gillmann and Kaibel, and has been extensively studied ever since. We prove that, for every fixed and every , with high probability the graph of has edge-expansion . This improves the previously best known bound due to Ferber, Krivelevich, Sales and Samotij, and verifies, in a strong form, the celebrated Mihail-Vazirani conjecture for random polytopes. Although the expansion factor is typically best possible for , we also show that the behaviour changes drastically at . Namely, for every fixed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
