
TL;DR
This paper demonstrates that random 0/1-polytopes typically exhibit much stronger edge-expansion than previously conjectured, with expansion rates depending on the sampling probability.
Contribution
It establishes new probabilistic bounds showing that random 0/1-polytopes have significantly higher edge-expansion than the longstanding conjecture suggested.
Findings
Edge-expansion is (n) for p ter 1/2
Edge-expansion is n^{(\u00a0log log n)} for p ter 0
Improves previous bound of (1) for typical 0/1-polytopes
Abstract
A 0/1-polytope is the convex hull of a subset . A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion at least 1. In this paper, we show that typical 0/1-polytopes have significantly stronger expansion. Specifically, if is formed by sampling each vertex of independently with constant probability , then with high probability the edge-expansion is for , and for . This improves the previously best known bound due to Ferber, Krivelevich, Sales and Samotij.
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.
