Factorization Formulas for $2D$ Critical Percolation, Revisited
Rene Conijn2015
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper from 2007 that the ratio $\mathbb{P}(nu_1 \leftrightarrow nu_2 \leftrightarrow nw)^{2}\,/\,\mathbb{P}(nu_1 \leftrightarrow nu_2)\cdot\mathbb{P}(nu_1 \leftrightarrow nw)\cdot\mathbb{P}(nu_2 \leftrightarrow nw)$ converges to $K_F$ as $n \to \infty$, where $x\leftrightarrow y$ denotes the event that $x$ and $y$ are in the same open cluster, and $K_F$ is an explicitly known constant. Beliaev and Izyurov proved in a paper in 2012 an analog of this factorization in the scaling limit. We prove, using their result and a generalized coupling argument, the earlier mentioned prediction. Furthermore we prove a factorization formula for the probability $\mathbb{P}(nu_2 \leftrightarrow [nu_1,nu_1+s];\, nw \leftrightarrow [nu_1,nu_1+s])$, where $s>0$.
Related papers
On the size of the largest cluster in 2D critical percolation
Electronic Communications in Probability, 2012
We consider (near-)critical percolation on the square lattice. Let Mn be the size of the largest open cluster contained in the box [−n, n] 2 , and let π(n) be the probability that there is an open path from O to the boundary of the box. It is well-known (see [BCKS01]) that for all 0 < a < b the probability that Mn is smaller than an 2 π(n) and the probability that Mn is larger than bn 2 π(n) are bounded away from 0 as n → ∞. It is a natural question, which arises for instance in the study of so-called frozenpercolation processes, if a similar result holds for the probability that Mn is between an 2 π(n) and bn 2 π(n). By a suitable partition of the box, and a careful construction involving the building blocks, we show that the answer to this question is affirmative. The 'sublinearity' of 1/π(n) appears to be essential for the argument.
The full scaling limit of two-dimensional critical percolation
Arxiv preprint math/0504036, 2005
Abstract: We use SLE (6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice--that is, the scaling limit of the set of all interfaces ...
Two-Dimensional Critical Percolation: The Full Scaling Limit
Communications in Mathematical Physics, 2006
We use SLE 6 paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice-that is, the scaling limit of the set of all interfaces between different clusters. Some properties of the loop process, including conformal invariance, are also proved.
Series expansions of the percolation probability on the directed triangular lattice
Journal of Physics A: Mathematical and General, 1996
We have derived long series expansions of the percolation probability for site, bond and site-bond percolation on the directed triangular lattice. For the bond problem we have extended the series from order 12 to 51 and for the site problem from order 12 to 35. For the site-bond problem, which has not been studied before, we have derived the series to order 32. Our estimates of the critical exponent β are in full agreement with results for similar problems on the square lattice, confirming expectations of universality. For the critical probability and exponent we find in the site case: q c = 0.4043528 ± 0.0000010 and β = 0.27645 ± 0.00010; in the bond case: q c = 0.52198 ± 0.00001 and β = 0.2769 ± 0.0010; and in the site-bond case: q c = 0.264173 ± 0.000003 and β = 0.2766 ± 0.0003. In addition we have obtained accurate estimates for the critical amplitudes. In all cases we find that the leading correction to scaling term is analytic, i.e., the confluent exponent ∆ = 1.
Planar Critical Percolation: Large clusters and Scaling limits
2015
This chapter is based on [10] with Rob van den Berg. We consider (near-)critical percolation on the square lattice. Let M n be the size of the largest open cluster contained in the box [−n, n] 2 , and let π(n) be the probability that there is an open path from O to the boundary of the box. It is well-known (see [17]) that for all 0 < a < b the probability that M n is smaller than an 2 π(n) and the probability that M n is larger than bn 2 π(n) are bounded away from 0 as n → ∞. It is a natural question, which arises for instance in the study of so-called frozenpercolation processes, if a similar result holds for the probability that M n is between an 2 π(n) and bn 2 π(n). By a suitable partition of the box, and a careful construction involving the building blocks, we show that the answer to this question is armative. The`sublinearity' of 1/π(n) appears to be essential for the argument. percolation and FK-Ising This chapter is based on [20] with Federico Camia and Demeter Kiss. Under some general assumptions we construct the scaling limit of open clusters and their associated counting measures in a class of two-dimensional percolation models. Our results apply, in particular, to critical Bernoulli site percolation on the triangular lattice. We also provide conditional results for the critical FK-Ising model on the square lattice. Fundamental properties of the scaling limit, such as conformal covariance, are explored. Applications such as the scaling limit of the largest cluster in a bounded domain and a geometric representation of the magnetization eld for the critical Ising model are presented.
Mean-field critical behaviour for percolation in high dimensions
Communications in Mathematical Physics, 1990
The triangle condition for percolation states that ]Γ τ(0,x) τ(x,y) χ,y-τ (y, 0) is finite at the critical point, where τ (x, y) is the probability that the sites x and y are connected. We use an expansion related to the lace expansion for a self-avoiding walk to prove that the triangle condition is satisfied in two situations: (i) for nearest-neighbour independent bond percolation on thê /-dimensional hypercubic lattice, if d is sufficiently large, and (ii) in more than six dimensions for a class of "spread-out" models of independent bond percolation which are believed to be in the same universality class as the nearest-neighbour model. The class of models in (ii) includes the case where the bond occupation probability is constant for bonds of length less than some large number, and is zero otherwise. In the course of the proof an infrared bound is obtained. The triangle condition is known to imply that various critical exponents take their mean-field (Bethe lattice) values (y = β = 1, δ = Δ t = 2, ί ^ 2) and that the percolation density is continuous at the critical point. We also prove that v 2 = 1/2 in (i) and (ii), where v 2 is the critical exponent for the correlation length.
The high temperature Ising model on the triangular lattice is a critical percolation model
Eprint Arxiv 0806 3020, 2008
The Ising model at inverse temperature $\beta$ and zero external field can be obtained via the Fortuin-Kasteleyn (FK) random-cluster model with $q=2$ and density of open edges $p=1-e^{-\beta}$ by assigning spin +1 or -1 to each vertex in such a way that (1) all the vertices in the same FK cluster get the same spin and (2) +1 and -1 have equal probability. We generalize the above procedure by assigning spin +1 with probability $r$ and -1 with probability $1-r$, with $r \in [0,1]$, while keeping condition (1). For fixed $\beta$, this generates a dependent (spin) percolation model with parameter $r$. We show that, on the triangular lattice and for $\beta<\beta_c$, this model has a percolation phase transition at $r=1/2$, corresponding to the Ising model. This sheds some light on the conjecture that the high temperature Ising model on the triangular lattice is in the percolation universality class and that its scaling limit can be described in terms of SLE$_6$. We also prove uniqueness of the infinite +1 cluster for $r>1/2$, sharpness of the percolation phase transition (by showing exponential decay of the cluster size distribution for $r<1/2$), and continuity of the percolation function for all $r \in [0,1]$.
Spanning probability in 2D percolation
Physical Review Letters, 1992
The probability Rl. (p) for a site percolation cluster to span a square lattice of side L at occupancy p is reexamined using extensive simulations and exact calculations. It is confirmed that Ri, (p,)~2 as I~oo in agreement with universality but not with renormalization-group theory. Many estimates of p, that derive from Ri, (p) are shown to scale with L more weakly than normal finite-size scaling, and the value p, = 0.592 7460 + 0.0000005 is determined.
Universal scaling functions for bond percolation on planar random and square lattices with multiple percolating clusters
2001
Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on L_1× L_2 planar random lattices, duals of random lattices, and square lattices with free and periodic boundary conditions, in vertical and horizontal directions, respectively, and with various aspect ratio L_1/L_2. We calculate the probability for the appearance of n percolating clusters, W_n, the percolating probabilities, P, the average fraction of lattice bonds (sites) in the percolating clusters, <c^b>_n (<c^s>_n), and the probability distribution function for the fraction c of lattice bonds (sites), in percolating clusters of subgraphs with n percolating clusters, f_n(c^b) (f_n(c^s)). Using a small number of nonuniversal metric factors, we find that W_n, P, <c^b>_n (<c^s>_n), and f_n(c^b) (f_n(c^s)) for random lattices, duals of random lattices, and square lattices have the same universal fi...
Boundary Condition Dependence of Cluster Size Ratios in Random Percolation
International Journal of Modern Physics C, 2000
We study the ratio of the number of sites in the largest and second largest clusters in random percolation. Using the scaling hypothesis that the ratio / of the mean cluster sizes M1 and M2 scales as f ((p - pc) L1/ν), we employ finite-size scaling analysis to find that / is nonuniversal with respect to the boundary conditions imposed. The mean of the ratios behaves similarly although with a distinct critical value reflecting the relevance of mass fluctuations at the percolation threshold. These zero exponent ratios also allow for reliable estimates of the critical parameters at percolation from relatively small lattices.
Related papers
The gaps between the sizes of large clusters in 2D critical percolation
Electronic Communications in Probability, 2013
Consider critical bond percolation on a large 2n × 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n 2 π(n), where π(n) denotes the probability that there is an open path from the center to the boundary of the box. The same result holds for the second-largest cluster, the third largest cluster etcetera. Járai showed that the differences between the sizes of these clusters is, with high probability, at least of order n 2 π(n). Although this bound was enough for his applications (to incipient infinite clusters), he believed, but had no proof, that the differences are in fact of the same order as the cluster sizes themselves, i.e. n 2 π(n). Our main result is a proof that this is indeed the case.
Scaling Limits of Two-Dimensional Percolation: an Overview
Statistica Neerlandica, 2008
We present a review of the recent progress on percolation scaling limits in two dimensions. In particular, we will consider the convergence of critical crossing probabilities to Cardy's formula and of the critical exploration path to chordal SLE(6), the full scaling limit of critical cluster boundaries, and near-critical scaling limits.
Trivial, Critical and Near-critical Scaling Limits of Two-dimensional Percolation
Journal of Statistical Physics, 2009
It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of the plane are surrounded by arbitrarily large loops and every deterministic point is almost surely surrounded
On Crossing Event Formulas in Critical Two-Dimensional Percolation
Journal of Statistical Physics, 2003
Several formulas for crossing functions arising in the continuum limit of critical two-dimensional percolation models are studied. These include Watts's formula for the horizontal-vertical crossing probability and Cardy's new formula for the expected number of crossing clusters. It is shown that for lattices where conformal invariance holds, they simplify when the spatial domain is taken to be the interior of an equilateral triangle. The two crossing functions can be expressed in terms of an equianharmonic elliptic function with a triangular rotational symmetry. This suggests that rigorous proofs of Watts's formula and Cardy's new formula will be easiest to construct if the underlying lattice is triangular. The simplification in a triangular domain of Schramm's “bulk Cardy's formula” is also studied.
On the critical percolation probabilities
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, 1981
We prove that the critical probabilities of site percolation on the square lattice satisfy the relation pc+p*=l. Furthermore we prove the continuity of the function "percolation probability".
Critical Behaviors and Universality Classes of Percolation Phase Transitions on Two-Dimensional Square Lattice*
Communications in Theoretical Physics, 2015
We have investigated both site and bond percolation on two-dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked randomly, the site or bond with the smaller size product of two connected clusters is added when the product rule is taken. Not only the size of the largest cluster but also its size jump are studied to characterize the universality class of percolation. The finite-size scaling forms of giant cluster size and size jump are proposed and used to determine the critical exponents of percolation from Monte Carlo data. It is found that the critical exponents of both size and size jump in random site percolation are equal to that in random bond percolation. With the random rule, site and bond percolation belong to the same universality class. We obtain the critical exponents of the site percolation under the product rule, which are different from that of bo...
The scaling limit geometry of near-critical 2D percolation
Journal of statistical physics, 2006
We analyze the geometry of scaling limits of near-critical 2D percolation, ie, for p= p c+ λδ 1/ν, with ν= 4/3, as the lattice spacing δ→ 0. Our proposed framework extends previous analyses for p= pc, based on SLE 6. It combines the continuum nonsimple loop ...
Universality in Two-Dimensional Enhancement Percolation
2007
We consider a type of dependent percolation introduced by Aizenman and Grimmett, who showed that certain "enhancements" of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In this paper we first prove that, for two-dimensional enhancements with a natural monotonicity property, being essential is also a necessary condition to shift the critical point. We then show that (some) critical exponents and the scaling limit of crossing probabilities of a two-dimensional percolation process are unchanged if the process is subjected to a monotonic enhancement that is not essential. This proves a form of universality for all dependent percolation models obtained via a monotonic enhancement (of Bernoulli percolation) that does not shift the critical point. For the case of site percolation on the triangular lattice, we also prove a stronger form of universality by showing that the full scaling limit is not affected by any...
Scaling behavior in very small percolation lattices
Physical Review C, 1997
We examine the average cluster distribution as a function of lattice probability for a very small (Lϭ6) lattice and determine the scaling function of three-dimensional percolation. The behavior of the second moment, calculated from the average cluster distribution of Lϭ6 and Lϭ63 lattices, is compared to power-law behavior predicted by the scaling function. We also examine the finite-size scaling of the critical point and the size of the largest cluster at the critical point. This analysis leads to estimates of the critical exponent and the ratio of critical exponents /. ͓S0556-2813͑97͒02703-9͔
Scaling Limit and Critical Exponents for Two-Dimensional Bootstrap Percolation
Journal of Statistical Physics, 2005
Consider a cellular automaton with state space {0, 1} Z 2 where the initial configuration ω 0 is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least three neighboring 1's. In this paper we show that the configuration ω n at time n converges exponentially fast to a final configurationω, and that the limiting measure corresponding toω is in the universality class of Bernoulli (independent) percolation. More precisely, assuming the existence of the critical exponents β, η, ν and γ, and of the continuum scaling limit of crossing probabilities for independent site percolation on the close-packed version of Z 2 (i.e., for independent *-percolation on Z 2), we prove that the bootstrapped percolation model has the same scaling limit and critical exponents. This type of bootstrap percolation can be seen as a paradigm for a class of cellular automata whose evolution is given, at each time step, by a monotonic and nonessential enhancement [1, 11].
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.