TY - JOUR
T1 - Large-N limit of crossing probabilities, discontinuity, and asymptotic behavior of threshold values in mandelbrot’s fractal percolation process
AU - Broman, Erik I.
AU - Camia, Federico
N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2008/1/1
Y1 - 2008/1/1
N2 - We study Mandelbrot’s percolation process in dimension d ≥ 2. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube [0,1]d in Nd subcubes, and independently retaining or discarding each subcube with probability p or 1 – p respectively. This step is then repeated within the retained subcubes at all scales. As p is varied, there is a percolation phase transition in terms of paths for all d ≥ 2, and in terms of (d – 1)-dimensional “sheets” for all d ≥ 3. For any d ≥ 2, we consider the random fractal set produced at the path-percolation critical value pc(N, d), and show that the probability that it contains a path connecting two opposite faces of the cube [0,1]d tends to one as N → ∞. As an immediate consequence, we obtain that the above probability has a discontinuity, as a function of p, at pc(N, d) for all N sufficiently large. This had previously been proved only for d = 2 (for any N ≥ 2). For d ≥ 3, we prove analogous results for sheet-percolation. In dimension two, Chayes and Chayes proved that pc(N, 2) converges, as N → ∞, to the critical density pc of site percolation on the square lattice. Assuming the existence of the correlation length exponent v for site percolation on the square lattice, we establish the speed of convergence up to a logarithmic factor. In particular, our results imply that pc(N, 2) – pc = (1/N)1/v+o(1) as N → ∞, showing an interesting relation with near-critical percolation .
AB - We study Mandelbrot’s percolation process in dimension d ≥ 2. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube [0,1]d in Nd subcubes, and independently retaining or discarding each subcube with probability p or 1 – p respectively. This step is then repeated within the retained subcubes at all scales. As p is varied, there is a percolation phase transition in terms of paths for all d ≥ 2, and in terms of (d – 1)-dimensional “sheets” for all d ≥ 3. For any d ≥ 2, we consider the random fractal set produced at the path-percolation critical value pc(N, d), and show that the probability that it contains a path connecting two opposite faces of the cube [0,1]d tends to one as N → ∞. As an immediate consequence, we obtain that the above probability has a discontinuity, as a function of p, at pc(N, d) for all N sufficiently large. This had previously been proved only for d = 2 (for any N ≥ 2). For d ≥ 3, we prove analogous results for sheet-percolation. In dimension two, Chayes and Chayes proved that pc(N, 2) converges, as N → ∞, to the critical density pc of site percolation on the square lattice. Assuming the existence of the correlation length exponent v for site percolation on the square lattice, we establish the speed of convergence up to a logarithmic factor. In particular, our results imply that pc(N, 2) – pc = (1/N)1/v+o(1) as N → ∞, showing an interesting relation with near-critical percolation .
KW - Critical probability
KW - Crossing probability
KW - Enhancement/diminishment percolation
KW - Fractal percolation
KW - Near-critical percolation
UR - http://www.scopus.com/inward/record.url?scp=45849139008&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=45849139008&partnerID=8YFLogxK
U2 - 10.1214/EJP.v13-511
DO - 10.1214/EJP.v13-511
M3 - Article
AN - SCOPUS:45849139008
VL - 13
SP - 980
EP - 999
JO - Electronic Journal of Probability
JF - Electronic Journal of Probability
SN - 1083-6489
ER -