arXiv Analytics

Sign in

arXiv:1803.11553 [math.PR]AbstractReferencesReviewsResources

Asymptotics in percolation on high-girth expanders

Michael Krivelevich, Eyal Lubetzky, Benny Sudakov

Published 2018-03-30, updated 2020-01-08Version 2

We consider supercritical bond percolation on a family of high-girth $d$-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linear-sized ("giant'') component is $p_c=1/(d-1)$. Our main result recovers the sharp asymptotics of the size and degree distribution of the vertices in the giant and its 2-core at any $p>p_c$. It was further shown in [ABS04] that the second largest component, at any $0<p<1$, has size at most $n^{\omega}$ for some $\omega<1$. We show that, unlike the situation in the classical Erd\H{o}s-R\'enyi random graph, the second largest component in bond percolation on a regular expander, even with an arbitrarily large girth, can have size $n^{\omega'}$ for $\omega'$ arbitrarily close to $1$. Moreover, as a by-product of that construction, we answer negatively a question of Benjamini (2013) on the relation between the diameter of a component in percolation on expanders and the existence of a giant component. Finally, we establish other typical features of the giant component, e.g., the existence of a linear path.

Comments: 22 pages, 1 figure
Categories: math.PR, math.CO
Subjects: 60K35, 05C80
Related articles: Most relevant | Search more
arXiv:2501.02433 [math.PR] (Published 2025-01-05)
On the jump of the cover time in random geometric graphs
arXiv:math/0610459 [math.PR] (Published 2006-10-15, updated 2016-07-31)
The mixing time of the giant component of a random graph
arXiv:0801.1608 [math.PR] (Published 2008-01-10, updated 2009-01-05)
The second largest component in the supercritical 2D Hamming graph