On the edge expansion of random polytopes
Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij
Abstract
A 0/1-polytope in is the convex hull of a subset of . The graph of a polytope is the graph whose vertices are the zero-dimensional faces of and whose edges are the one-dimensional faces of . A conjecture of Mihail and Vazirani states that the edge expansion of the graph of every 0/1-polytope is at least one. We study a random version of the problem, where the polytope is generated by selecting vertices of independently at random with probability . Improving earlier results, we show that, for any , with high probability the edge expansion of the random 0/1-polytope is bounded from below by an absolute constant.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 70d87b99-63db-498c-b6b1-43d4d7ca3587Related papers
- Towards the Erdős-Gallai Cycle Decomposition ConjectureMatija Bucic, Richard MontgomerySTOC 2023
- Cheeger Inequalities for Vertex Expansion and Reweighted EigenvaluesTsz Chiu Kwok, Lap Chi Lau, Kam Chuen TungFOCS 2022 · 5 citations
- Local and Global Expansion in Random Geometric GraphsSiqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth YangSTOC 2023 · 4 citations
- The Connectivity Threshold for Dense GraphsAnupam Gupta, Euiwoong Lee, Jason LiSODA 2021 · 2 citations
- First order distinguishability of sparse random graphsTal Hershko, Maksim ZhukovskiiLICS 2024
