Universal correlations in percolation

Robert M. Ziff

Front. Phys. ›› 2020, Vol. 15 ›› Issue (4) : 41502

PDF (561KB)
Front. Phys. ›› 2020, Vol. 15 ›› Issue (4) :41502 DOI: 10.1007/s11467-020-0975-3
VIEW & PERSPECTIVE
Universal correlations in percolation
Author information +
History +
PDF (561KB)

Cite this article

Download citation ▾
Robert M. Ziff. Universal correlations in percolation. Front. Phys., 2020, 15 (4) : 41502 DOI:10.1007/s11467-020-0975-3

登录浏览全文

4963

注册一个新账户 忘记密码

Percolation is the process where connections from link to link in random systems leads to clustering and long-range connectivity. A standard model of percolation is a regular lattice, with the links being nearest-neighbor bonds that are randomly occupied (bond percolation), or all links exist and random sites (vertices) are occupied (site percolation). At a critical occupancy fraction pc of sites or bonds, the mean cluster size in an infinite system first becomes infinite, and many properties become universal for a given dimensionality. The characteristics of the universal behavior has been the focus of much research for decades [1-5].
Correlations follow universal power-law behavior at the critical point. Define P(r1,r2) as the probability that two lattice points a distance r=|r1−r2| apart belong to the same cluster. For large r, at the critical threshold, P is expected to behave as
(1)P(r1,r2)∼r−2(d−df),
where d is the dimensionality and df is the fractal dimension, with the values df=91/48 in two dimensions (2D), 2.5229 in 3D, etc. While these exponent values are expected to be the same for all percolation systems at criticality (i.e., universal), the coefficient in Eq. (1) cannot be universal because it depends upon the lattice-level behavior and thus the specific lattice and percolation type (site or bond). Furthermore, if one takes a continuum limit of percolation where the lattice mesh size goes to zero, the probability that a point belongs to a given cluster goes to zero, because of the fractal nature of critical percolation clusters. Universality in that limit can be recovered by looking at properties that do not depend upon lattice-level properties, such as the probability of crossing from one segment of the boundary of a finite system to another. For correlation functions, one can recover universality by looking at certain ratios of functions. If we define Pε(r1,r2) as the probability that there is connectivity between the surfaces of two spheres of radius ε around each of the two points r1 and r2, then this quantity survives in the limit that the mesh goes to zero, and will be proportional to the product of the two surface areas (εd−1)2. By taking ratios of correlations functions, one can get quantities whose factors cancel out, and survive in the limit ε→0, and many of these ratios are accessible by conformal theory methods. For example, the ratio,
(2)R=P(r1,r2,r3)P(r1,r2)P(r1,r3)P(r2,r3),
where P(r1,r2,r3) is the probability that three far-separated points connect together in a single cluster, has a universal value of 27/23−3/4π5/2Γ(1/3)−9/2≈1.0299 [6] when two of the points are on the boundary, and 2.02201 when all three points are internal [6, 7].
In Ref. [8], Vasseur, Jacobsen, and Saleur introduced the idea of looking at correlations between two groups of neighboring points, the groups separated a long distance from each other, and looked at different possible connections. They show that certain combinations of these correlations have power-law behavior, with exponents in 2D that can be predicted theoretically, and also identified a ratio [F(r) below] in which the power-law cancels out and a universal logarithmic term remains.
In a recent paper [9], Tan, Couvreur, Deng, and Jacobsen studied these correlations in 2D and 3D, confirming the exact predictions for 2D and numerically finding the exponents in 3D. In the present paper [10], Tan, Deng, and Jacobsen studied these correlations in 4D and 5D. These higher dimensions are theoretically of interest because, in percolation, the upper critical dimension is 6, meaning that the behavior becomes mean-field, similar to that on the complete graph or the Bethe lattice, where exponents are known exactly and simple rational values. A great deal of work has been done over the years in finding series expansions about six dimensions, in powers of ϵ=6−d, and finding results in 4 and 5 dimensions is particularly useful in evaluating the accuracy of those series expansions. In general, substantially less work has been done in percolation in 4 and 5 dimensions compared with lower dimensions. One of the problems is the constraints on lattice size that one can simulate on a computer, considering the value of Ld for d=4 or 5.
Here, the authors look at correlations between two separated sets of neighboring points belonging to different combinations of clusters. They consider N neighboring points (N=2 and 3) and another N neighboring points separated a distance L/2 from the first points, in a periodic system. They use a variant of the Hoshen–Kopelman algorithm on an Ld−1×L′ lattice where L′≫L to study these correlations, joining two separate systems together to form a layer in a bulk system to study the correlations, and then returning to the un-joined systems to add additional layers. They use a Union-Find algorithm [11] with a simple compression step and a flattening step to efficiently carry out this algorithm. One of the advantages of using this algorithm is that they could simulate a larger L than if the system were simply periodic of size Ld, because only one plane needs to be stored in the L′ direction.
The authors look at configurations where the N points in each of the two groups belong to different clusters — already something of low probability — and then look at various combinations of connectivites between the two sets of points along clusters joining them. Finally, by looking at certain symmetric PNs, asymmetric PNa, and mixed PNm combinations, they find quantities that also decay as a power-law in r, defined as the distance between these two sets of points. This defines various exponents according to
(3)PNo∼r−2XNo,
where o = s, m, a and N=2,3. In their paper, they present precise values of these exponents XNo. These are new universal quantities that have never been measured before. Because of the low probability of these events, extensive simulations were necessary to reveal the behavior.
For example, for N=2, they define
(4)P2s=P(r1,r3|r2,r4)+P(r1,r4|r2,r3),
(5)P2a=P(r1,r3|r2,r4)−P(r1,r4|r2,r3),
where the points r1,r2 are in one neighboring set, and r3,r4 are in another neighboring set a distance L/2 away from the first set. Here the vertical bar separates the points that are connected together. In Ref. [10], a graphical representation of these quantities is used.
Likewise for N=3, where there are 6 total points, three functions P3a, P3s, and P3m are defined. They can also extend this to N=1, which is identical to Eq. (1) above with X1s=d−df. Here they quote values of X2s from a recent paper of one of the authors, Ref. [12].
They also study the combination of correlations for N=2 that is expected to show a logarithmic behavior with a universal coefficient δ:
(6)F(r)=ℙ0(r)+ℙ1(r)−(ℙ≠)2ℙ2s(r)∼δlnr,
where ℙ0 is the probability that the four points all belong to different clusters, ℙ1 is the probability that the points belong to three different clusters, with one cluster linking one point in one set to a point in the other, and ℙ≠ is the probability that the two points in a single set belong to different clusters. In 2D, we know that on a square lattice ℙ≠=1/4 [13], but it is not known in higher dimensions. Carrying out precise studies, the authors find δ=1.16(1) in 4D and 0.74(6) in 5D. These are new results, and together with their previous work in 2D and 3D, paint a very complete picture on the universal behavior of these quantities.
The exponent X2s is related to the correlation-length exponent ν by X2s=d−yt=d−1/ν, and their measurements of this exponent yields substantially increased precision of the value of this important exponent in 4D and 5D. They find yt=1.4610(12) or ν=0.6845(6) in 4D and yt=1.737(2) or ν=0.5757(6) in 5D, compared to other recent results ν=0.6852(28) by Koza and Poła [14] and 0.6845(23) by Zhang et al. [12], and consistent with older results 0.6782(50) of Adler et al. [15] and 0.689(10) of Ballesteros et al. [16] in 4D, and ν=0.5723(18) [14] and 0.5737(33) [12] in recent works, and 0.571(3) in Adler et al. [15] from 1990 in 5D. These various results are generally consistent with each other within error bars, despite the variety of methods that were used, highlighting the high level of understanding of percolation that has been developed over the last several decades.
Besides Monte Carlo work, another classical approach has been through series expansions about 6D, and recently Gracey [17] has extended those series to higher order and has made the following predictions: ν=0.6920 in 4D and 0.5746 in 5D. These results are a bit lower and outside the error bars of results found here, but not far off. Perhaps higher-order series and/or future Monte Carlo work will show closer agreement.
For future work, it might be nice to demonstrate that these results are indeed universal by looking at another system, such as site percolation on a hypercubic lattice or site or bond percolation on a generalized FCC lattice, for example, although it is generally expected that universality should hold. Other combinations of correlations, such as the ratio of Eq. (2), might also be of interest in higher dimensions.

References

[1]

Cardy J. L., Critical percolation in finite geometries, J. Phys. Math. Gen. 25(4), L201 (1992)

[2]

Smirnov S. and Werner W., Critical exponents for two-dimensional percolation, Math. Res. Lett. 8(6), 729 (2001)

[3]

Saleur H. and Duplantier B., Exact determination of the percolation hull exponent in two dimensions, Phys. Rev. Lett. 58(22), 2325 (1987)

[4]

Stauffer D. and Aharony A., Introduction to Percolation Theory, 2nd Ed., CRC Press, 1994

[5]

Langlands R. P., Pichet C., Pouliot P., and SaintAubin Y., On the universality of crossing probabilities in two-dimensional percolation, J. Stat. Phys. 67(3–4), 553 (1992)

[6]

Simmons J. J. H., Ziff R. M., and Kleban P., Factorization of percolation density correlation functions for clusters touching the sides of a rectangle, J. Stat. Mech. Th. Exp. 2009, P02067 (2009)

[7]

Delfino G. and Viti J., On three-point connectivity in two-dimensional percolation, J. Phys. A Math. Theor. 44(3), 032001 (2011)

[8]

Vasseur R., Jacobsen J. L., and Saleur H., Logarithmic observables in critical percolation, J. Stat. Mech. 2012(07), L07001 (2012)

[9]

Tan X., Couvreur R., Deng Y., and Jacobsen J. L., Observation of nonscalar and logarithmic correlations in two- and three-dimensional percolation, Phys. Rev. E 99(5), 050103 (2019)

[10]

Tan X., Deng Y., and Jacobsen J. L., N-cluster correlations in four- and five-dimensional percolation, Front. Phys. 15(4), 41501 (2020)

[11]

Newman M. E. J. and Ziff R. M., Efficient Monte Carlo algorithm and high-precision results for percolation, Phys. Rev. Lett. 85(19), 4104 (2000)

[12]

Zhang Z., Hou P., Fang S., Hu H., and Deng Y., Critical exponents and universal excess cluster number of percolation in four and five dimensions, arXiv: 2004.11289 (2020)

[13]

Hu H., Blöte H. W. J., Ziff R. M., and Deng Y., Short-range correlations in percolation at criticality, Phys. Rev. E 90(4), 042106 (2014)

[14]

Koza Z. and Poła J., From discrete to continuous percolation in dimensions 3 to 7, J. Stat. Mech. 2016(10), 103206 (2016)

[15]

Adler J., Meir Y., Aharony A., and Harris A. B., Series study of percolation moments in general dimension, Phys. Rev. B 41(13), 9183 (1990)

[16]

Ballesteros H. G., Fernández L. A., Martín-Mayor V., Muñoz Sudupe A., Parisi G., and Ruiz-Lorenzo J. J., Measures of critical exponents in the four-dimensional site percolation, Phys. Lett. B 400(3–4), 346 (1997)

[17]

Gracey J. A., Four loop renormalization of ϕ3 theory in six dimensions, Phys. Rev. D 92(2), 025012 (2015)

Rights & permissions

Higher Education Press 2020

PDF (561KB)

1280

Accesses

0

Citation

Detail

Sections
Recommended

/

〈 〉