Phase transition for accessibility percolation on hypercubes
arXiv:1502.07642
Abstract
In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these random variables increase along the path. We establish a sharp phase transition depending on the difference of the values at the two endpoints, and determine the critical window of the phase transition. Our result completely resolves a conjecture of Berestycki, Brunet and Shi (2014).
arXiv comment26 pages, accepted by Journal of Theoretical Probability
References in corpus (6)
- Chaos, concentration, and multiple valleys
- The number of accessible paths in the hypercube
- Increasing paths in regular trees
- Accessibility percolation and first-passage site percolation on the unoriented binary hypercube
- Accessibility percolation with backsteps
- On the existence of accessibility in a tree-indexed percolation model