Power-law bounds for critical long-range percolation below the upper-critical dimension

We study long-range Bernoulli percolation on $${\mathbb {Z}}^d$$ Z d in which each two vertices x and y are connected by an edge with probability $$1-\exp (-\beta \Vert x-y\Vert ^{-d-\alpha })$$ 1 - exp ( - β ‖ x - y ‖ - d - α ) . It is a theorem of Noam Berger (Commun. Math. Phys., 2002) that if $$0<\alpha <d$$ 0 < α < d then there is no infinite cluster at the critical parameter $$\beta _c$$ β c . We give a new, quantitative proof of this theorem establishing the power-law upper bound $$\begin{aligned} {\mathbf {P}}_{\beta _c}\bigl (|K|\ge n\bigr ) \le C n^{-(d-\alpha )/(2d+\alpha )} \end{aligned}$$ P β c ( | K | ≥ n ) ≤ C n - ( d - α ) / ( 2 d + α ) for every $$n\ge 1$$ n ≥ 1 , where K is the cluster of the origin. We believe that this is the first rigorous power-law upper bound for a Bernoulli percolation model that is neither planar nor expected to exhibit mean-field critical behaviour. As part of the proof, we establish a universal inequality implying that the maximum size of a cluster in percolation on any finite graph is of the same order as its mean with high probability. We apply this inequality to derive a new rigorous hyperscaling inequality $$(2-\eta )(\delta +1)\le d(\delta -1)$$ ( 2 - η ) ( δ + 1 ) ≤ d ( δ - 1 ) relating the cluster-volume exponent $$\delta $$ δ and two-point function exponent $$\eta $$ η .

Critical p=1/2 in percolation on semi-infinite strips

We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has a continuous limit of 1/2 and argue that this limit is universal for planar systems. This value is also expected to hold for finite systems for any self-matching lattice. We attribute this result to the asymptotic symmetry of the separation lines between alternating spanning clusters of occupied and unoccupied sites formed on the original and matching lattice, respectively.

Shortest path and Schramm-Loewner evolution

We numerically show that the statistical properties of the shortest path on critical percolation clusters are consistent with the ones predicted for Schramm-Loewner evolution (SLE) curves for κ = 1.04 ± 0.02. The shortest path results from a global optimization process. To identify it, one needs to explore an entire area. Establishing a relation with SLE permits to generate curves statistically equivalent to the shortest path from a Brownian motion. We numerically analyze the winding angle, the left passage probability, and the driving function of the shortest path and compare them to the distributions predicted for SLE curves with the same fractal dimension. The consistency with SLE opens the possibility of using a solid theoretical framework to describe the shortest path and it raises relevant questions regarding conformal invariance and domain Markov properties, which we also discuss.

Geometric structure of percolation clusters

We investigate the geometric properties of percolation clusters by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo simulations, we study the probability that a given edge is not a bridge but has both its loop arcs in the same loop and find that it is governed by the two-arm exponent. We then classify bridges into two types: branches and junctions. A bridge is a branch iff at least one of the two clusters produced by its deletion is a tree. Starting from a percolation configuration and deleting the branches results in a leaf-free configuration, whereas, deleting all bridges produces a bridge-free configuration. Although branches account for ≈43% of all occupied bonds, we find that the fractal dimensions of the cluster size and hull length of leaf-free configurations are consistent with those for standard percolation configurations. By contrast, we find that the fractal dimensions of the cluster size and hull length of bridge-free configurations are given by the backbone and external perimeter dimensions, respectively. We estimate the backbone fractal dimension to be 1.643 36(10).

Percolation with long-range correlated disorder

Long-range power-law correlated percolation is investigated using Monte Carlo simulations. We obtain several static and dynamic critical exponents as functions of the Hurst exponent H, which characterizes the degree of spatial correlation among the occupation of sites. In particular, we study the fractal dimension of the largest cluster and the scaling behavior of the second moment of the cluster size distribution, as well as the complete and accessible perimeters of the largest cluster. Concerning the inner structure and transport properties of the largest cluster, we analyze its shortest path, backbone, red sites, and conductivity. Finally, bridge site growth is also considered. We propose expressions for the functional dependence of the critical exponents on H.

Crossover from isotropic to directed percolation

We generalize the directed percolation (DP) model by relaxing the strict directionality of DP such that propagation can occur in either direction but with anisotropic probabilities. We denote the probabilities as p(↓) = pp(d) and p(↑) = p(1-p(d)), with p representing the average occupation probability and p(d) controlling the anisotropy. The Leath-Alexandrowicz method is used to grow a cluster from an active seed site. We call this model with two main growth directions biased directed percolation (BDP). Standard isotropic percolation (IP) and DP are the two limiting cases of the BDP model, corresponding to p(d) =1/2 and p(d) = 0,1 respectively. In this work, besides IP and DP, we also consider the 1/2 < p(d) <1 region. Extensive Monte Carlo simulations are carried out on the square and the simple-cubic lattices, and the numerical data are analyzed by finite-size scaling. We locate the percolation thresholds of the BDP model for p(d) = 0.6 and 0.8, and determine various critical exponents. These exponents are found to be consistent with those for standard DP. We also determine the renormalization exponent associated with the asymmetric perturbation due to p(d)-1/2 ≠ 0 near IP, and confirm that such an asymmetric scaling field is relevant at IP.

Rigorous confidence intervals for critical probabilities

We use the method of Balister, Bollobás, and Walters [Random Struct. Algorithms 26, 392 (2005)] to give rigorous 99.9999% confidence intervals for the critical probabilities for site and bond percolation on the 11 Archimedean lattices. In our computer calculations, the emphasis is on simplicity and ease of verification, rather than obtaining the best possible results. Nevertheless, we obtain intervals of width at most 0.0005 in all cases.