The Mihail-Vazirani conjecture and strong edge-expansion in random 0/1 polytopes
Abstract
We study the edge-expansion of the graph of a random 0/1 polytope Pdp, defined as the convex hull of a random subset of the points in \0,1\d where every point is retained independently and with probability p. 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 >0 and every p∈(0,1-], with high probability the graph of Pdp has edge-expansion (d). 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 0/1 polytopes. Although the expansion factor (d) is typically best possible for p 1/2+, we also show that the behaviour changes drastically at p=1/2. Namely, for every fixed >0 and every integer k 2, if p 1/2-, then with high probability the graph of Pdp has edge-expansion (dk). Thus, random 0/1 polytopes exhibit an interesting phase transition at p=1/2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.