@article{c908afc90d5248f3bf6712bfddd5bcf5,
title = "Slightly subcritical hypercube percolation",
abstract = " We study bond percolation on the hypercube \{0,1\} m in the slightly subcritical regime where p = p c (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 −2 log(ε m 3 2 m )), that the maximal diameter of all clusters is (1+o(1))ε m −1 log(ε m 3 2 m ), and that the maximal mixing time of all clusters is Θ(ε m −3 log 2 (ε m 3 2 m )). 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. ",
keywords = "diameter, hypercube, mixing time, percolation, subcriticality",
author = "Tim Hulshof and Asaf Nachmias",
year = "2020",
month = mar,
day = "1",
doi = "10.1002/rsa.20853",
language = "English",
volume = "56",
pages = "557--593",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "Wiley",
number = "2",
}