@article{3b736180c81b40eaa92417fbc8ff8c7d,
title = "Slightly subcritical hypercube percolation",
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 (Formula presented.), that the maximal diameter of all clusters is (Formula presented.), and that the maximal mixing time of all clusters is (Formula presented.). 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",
note = "Publisher Copyright: {\textcopyright} 2019 The Authors. Random Structures and Algorithms published by Wiley Periodicals, Inc.",
year = "2020",
month = mar,
day = "1",
doi = "10.1002/rsa.20853",
language = "אנגלית",
volume = "56",
pages = "557--593",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "2",
}