Diameter and mixing time of the giant component in the percolated hypercube

Abstract

We consider bond percolation on the d-dimensional binary hypercube with p=c/d for fixed c>1. We prove that the typical diameter of the giant component L1 is of order (d), and the typical mixing time of the lazy random walk on L1 is of order (d2). This resolves long-standing open problems of Bollob\'as, Kohayakawa and uczak from 1994, and of Benjamini and Mossel from 2003. A key component in our approach is a new tight large deviation estimate on the number of vertices in L1 whose proof includes several novel ingredients: a structural description of the residue outside the giant component after sprinkling, a tight quantitative estimate on the spread of the giant in the hypercube, and a stability principle which rules out the disintegration of large connected sets under thinning. This toolkit further allows us to obtain optimal bounds on the expansion in L1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…