Expansion, long cycles, and complete minors in supercritical random subgraphs of the hypercube
Joshua Erde, Mihyun Kang, Michael Krivelevich

TL;DR
This paper investigates the complex structural properties of supercritical random subgraphs of hypercubes, revealing the presence of long cycles, large minors, and high genus in the phase where a giant component emerges.
Contribution
It establishes the existence of long cycles, large complete minors, and high genus in supercritical hypercube subgraphs, extending known results from random graphs to hypercubes.
Findings
Existence of cycles of length proportional to 2^d/d^3(log d)^3
Presence of complete minors of size proportional to 2^{d/2}/d^3(log d)^3
Largest component exhibits good edge-expansion properties
Abstract
Analogous to the case of the binomial random graph , it is known that the behaviour of a random subgraph of a -dimensional hypercube, where we include each edge independently with probability , which we denote by , undergoes a phase transition around the critical value of . More precisely, standard arguments show that significantly below this value of , with probability tending to one as (whp for short) all components of this graph have order , whereas Ajtai, Koml\'{o}s and Szemer\'{e}di showed that significantly above this value, in the \emph{supercritical regime}, whp there is a unique `giant' component of order . In much more is known about the complex structure of the random graph which emerges in this supercritical regime. For example, it is known that in this regime whp …
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Limits and Structures in Graph Theory
