English

Slightly subcritical hypercube percolation

Probability 2016-12-07 v1 Combinatorics

Abstract

We study bond percolation on the hypercube {0,1}m\{0,1\}^m in the slightly subcritical regime where p=pc(1εm)p = p_c (1-\varepsilon_m) and εm=o(1)\varepsilon_m = o(1) but εm2m/3\varepsilon_m \gg 2^{-m/3} and study the clusters of largest volume and diameter. We establish that with high probability the largest component has cardinality Θ(εm2log(εm32m))\Theta\left(\varepsilon_m^{-2} \log(\varepsilon_m^3 2^m)\right), that the maximal diameter of all clusters is (1+o(1))εm1log(εm32m)(1+o(1)) \varepsilon_m^{-1} \log(\varepsilon_m^3 2^m), and that the maximal mixing time of all clusters is Θ(εm3log2(εm32m))\Theta\left(\varepsilon_m^{-3} \log^2(\varepsilon_m^3 2^m)\right). 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

Cite

@article{arxiv.1612.01772,
  title  = {Slightly subcritical hypercube percolation},
  author = {Tim Hulshof and Asaf Nachmias},
  journal= {arXiv preprint arXiv:1612.01772},
  year   = {2016}
}

Comments

38 pages