Back to Search
Start Over
Slightly subcritical hypercube percolation.
- Source :
- Random Structures & Algorithms; Mar2020, Vol. 56 Issue 2, p557-593, 37p
- Publication Year :
- 2020
-
Abstract
- We study bond percolation on the hypercube {0,1}m in the slightly subcritical regime where p = pc(1 − εm) and εm = o(1) but εm ≫ 2−m/3 and study the clusters of largest volume and diameter. We establish that with high probability the largest component has cardinality Θεm−2log(εm32m), that the maximal diameter of all clusters is (1+o(1))εm−1log(εm32m), and that the maximal mixing time of all clusters is Θεm−3log2(εm32m). These results hold in different levels of generality, and in particular, some of the estimates hold for various classes of graphs such as high‐dimensional tori, expanders of high degree and girth, products of complete graphs, and infinite lattices in high dimensions. [ABSTRACT FROM AUTHOR]
- Subjects :
- PERCOLATION
MOLECULAR graphs
HYPERCUBES
COMPLETE graphs
DIAMETER
Subjects
Details
- Language :
- English
- ISSN :
- 10429832
- Volume :
- 56
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Random Structures & Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 141356288
- Full Text :
- https://doi.org/10.1002/rsa.20853