Abstract
Let \({\mathbb {L}}\) be the \(d\)-dimensional hypercubic lattice and let \({\mathbb {L}}_0\) be an \(s\)-dimensional sublattice, with \(2 \le s < d\). We consider a model of inhomogeneous bond percolation on \({\mathbb {L}}\) at densities \(p\) and \(\sigma \), in which edges in \({\mathbb {L}}\setminus {\mathbb {L}}_0\) are open with probability \(p\), and edges in \({\mathbb {L}}_0\) open with probability \(\sigma \). We generalize several classical results of (homogeneous) bond percolation to this inhomogeneous model. The phase diagram of the model is presented, and it is shown that there is a subcritical regime for \(\sigma < \sigma ^*(p)\) and \(p<p_c(d)\) (where \(p_c(d)\) is the critical probability for homogeneous percolation in \({\mathbb {L}}\)), a bulk supercritical regime for \(p>p_c(d)\), and a surface supercritical regime for \(p<p_c(d)\) and \(\sigma >\sigma ^*(p)\). We show that \(\sigma ^*(p)\) is a strictly decreasing function for \(p\in [0,p_c(d)]\), with a jump discontinuity at \(p_c(d)\). We extend the Aizenman–Barsky differential inequalities for homogeneous percolation to the inhomogeneous model and use them to prove that the susceptibility is finite inside the subcritical phase. We prove that the cluster size distribution decays exponentially in the subcritical phase, and sub-exponentially in the supercritical phases. For a model of lattice animals with a defect plane, the free energy is related to functions of the inhomogeneous percolation model, and we show how the percolation transition implies a non-analyticity in the free energy of the animal model. Finally, we present simulation estimates of the critical curve \(\sigma ^*(p)\).
Similar content being viewed by others
References
Aizenman, M., Barsky, D.J.: Sharpness of the phase transition in percolation models. Commun. Math. Phys. 108(3), 489–526 (1987)
Aizenman, M., Delyon, F., Souillard, B.: Lower bounds on the cluster size distributions. J. Stat. Phys. 23, 267–280 (1980)
Aizenman, M., Grimmett, G.: Strict monotonicity for critical points in percolation and ferromagnetic models. J. Stat. Phys. 63, 817–835 (1991)
Aizenman, M., Newman, C.M.: Tree graph inequalities and critical behavior in percolation models. J. Stat. Phys. 36, 107–143 (1984)
Barsky, D.J., Grimmett, G.R., Newman, C.M.: Percolation in half-spaces: equality of critical densities and continuity of the percolation probability. Probab. Theory Relat. Fields 90(1), 111–148 (1991)
Broadbent, S.R., Hammersley, J.M.: Percolation processes I. Crystals and mazes. Proc. Cambridge Philos. Soc. 53(3), 629–641 (1957)
Clerc, J.P., Carton, J.P., Roussenq, J., Stauffer, D.: Surface effects for percolation. J. Physique Lett. 42(12), 249–252 (1981)
Coniglio, A., Stanley, H.E., Klein, W.: Site-bond correlated-percolation problem: a statistical mechanical model of polymer gelation. Phys. Rev. Lett. 42(8), 518–522 (1979)
De’Bell, K.: Application of the real-space renormalisation group to percolation at a surface. J. Phys. C 12(16), L605–L612 (1979)
De’Bell, K.: Percolation at a surface: scaling theory and the real space renormalisation group. J. Phys. C 13(19), 3809–3815 (2000)
De’Bell, K., Essam, J.W.: Mean field theory of percolation with application to surface effects. J. Phys. A 14(8), 1993–2008 (1981)
De’Bell, K., Essam, J.W.: Series expansion studies of percolation at a surface. J. Phys. C 13(25), 4811–4822 (2000)
De’Bell, K., Lookman, T.: Surface phase transitions in polymer systems. Rev. Mod. Phys. 65(1), 87–113 (1993)
Essam, J.W.: Percolation and cluster size. Phase Trans. Crit. Phenom. 2, 197–270 (1972)
Essam, J.W.: Percolation theory. Rep. Prog. Phys. 43(7), 833–912 (2000)
Flesia, S., Gaunt, D.S., Soteros, C.E., Whittington, S.G.: Statistics of collapsing lattice animals. J. Phys. A 27(17), 5831–5846 (1999)
Friedli, S., Ioffe, D., Velenik, Y.: Subcritical percolation with a line of defects. Ann. Probab. 41, 2013–2046 (2013)
Ghiass, M., Rey, A.D., Dabir, B.: Microstructure evolution and simulation of copolymerization reaction using a percolation kinetic gelation model. Polymer 43(3), 989–995 (2002)
Grimmett, G.: Percolation 2nd (edn). Springer, Berlin (1999)
Grimmett, G.R., Marstrand, J.M.: The supercritical phase of percolation is well behaved. Proc. Roy. Soc. (London), Ser. A 430, 439–457 (1990)
Grimmett, G.R., Stirzaker, D.S.: Probability and Random Processes. Oxford University Press, Oxford (2001)
Hammersley, J.M.: Generalisation of the fundamental theorem on subadditive functions. Math. Proc. Cambridge Philos. Soc. 58(2), 235–238 (1962)
Hammersley, J.M., Welsh, D.: Origins of percolation theory. Ann. Israel Phys. Soc. 5(47–57), 9 (1983)
Harris, T.E.: A lower bound for the critical probability in a certain percolation process. Proc. Cambridge Philos. Soc. 56, 13–20 (1960)
Hille, E., Phillips, R.S.: Functional Analysis and Semi-Groups, vol. 31. American Mathematical Society, Providence, RI (1957)
Kesten, H.: The critical probability of bond percolation on the square lattice equals 1/2. Commun. Math. Phys. 74(1), 41–59 (1980)
Kesten, H.: Percolation Theory for Mathematicians. Birkhäuser, Basel (1982)
Kumar, S.K., Douglas, J.F.: Gelation in physically associating polymer solutions. Phys. Rev. Lett. 87(18), 188301 (2001)
Kunz, H., Souillard, B.: Essential singularity in percolation problems and asymptotic behaviour of cluster size distribution. J. Stat. Phys. 19, 77–106 (1978)
Lorenz, C.D., Ziff, R.M.: Precise determination of the bond percolation thresholds and finite-size scaling corrections for the sc, fcc, and bcc lattices. Phys. Rev. E 57(1), 230–236 (1998)
Madras, N., Schinazi, R., Schonmann, R.H.: On the critical behavior of the contact process in deterministic inhomogeneous environments. Ann. Probab. 22, 1140–1159 (1994)
Madras, N., Soteros, C.E., Whittington, S.G.: Statistics of lattice animals. J. Phys. A 21(24), 4617–4635 (1988)
Menshikov, M.V.: Coincidence of critical points in percolation problems. Sov. Math. Doklady 33, 856–859 (1986)
Menshikov, M.V.: Numerical bounds and strict inequalities for critical points of graphs and their subgraphs. Theory Probab. Appl. 32, 599–602 (1987)
Newman, C.M., Wu, C.C.: Percolation and contact processes with low-dimensional inhomogeneity. Ann. Probab. 25(4), 1832–1845 (1997)
Newman, M.E.J., Ziff, R.M.: Efficient monte carlo algorithm and high-precision results for percolation. Phys. Rev. Lett. 85(19), 4104–4107 (2000)
Patton, E.V., Wesson, J.A., Rubinstein, M., Wilson, J.C., Oppenheimer, L.E.: Scaling properties of branched polyesters. Macromolecules 22(4), 1946–1959 (1989)
Paul, G., Ziff, R.M., Stanley, H.E.: Percolation threshold, fisher exponent, and shortest path exponent for four and five dimensions. Phys. Rev. E 64(2), 026115 (2001)
Rubinstein, M., Colby, R.H., Gillmor, J.R.: Dynamic scaling for polymer gelation. Polym. Prepr. (ACS Div. Polym. Chem.) 30, 81–82 (1989)
Stauffer, D.: Gelation in concentrated critically branched polymer solutions. Percolation scaling theory of intramolecular bond cycles. J. Chem. Soc. Faraday Trans. 2(72), 1354–1364 (1976)
Stauffer, D.: Scaling theory of percolation clusters. Phys. Rep. 54(1), 1–74 (1979)
Stauffer, D., Aharony, A.: Introduction to Percolation Theory. Taylor and Francis, London (1991)
Stauffer, D., Coniglio, A., Adam, M.: Gelation and critical phenomena. Adv. Polym. Sci. 44, 103–158 (1982)
Wang, J., Zhou, Z., Zhang, W., Garoni, T.M., Deng, Y.: Bond and site percolation in three dimensions. Phys. Rev. E 87(5), 052107 (2013)
Zhang, Y.: A note on inhomogeneous percolation. Ann. Probab. 22, 803–819 (1994)
Acknowledgments
EJJvR and NM acknowledge support in the form of NSERC Discovery Grants from the Government of Canada. We also thank Geoffrey Grimmett for some helpful email correspondence.
Author information
Authors and Affiliations
Corresponding author
Appendix: Differential Inequalities for Inhomogeneous Percolation
Appendix: Differential Inequalities for Inhomogeneous Percolation
In this appendix our aim is to prove the following differential inequalities
where \(\nabla = (\frac{\partial }{\partial p}, \frac{\partial }{\partial \sigma })\) and \(p\le \sigma \). These are Eqs. (29) and (30).
These inequalities are due to Aizenman and Barsky [1] for homogeneous bond percolation (the proofs can be found in reference [19] as well), and we adapt their proofs to the inhomogeneous model.
Let \(B(N)\) be the box of side-length \(2N\) centered at the origin of \({\mathbb {L}}\). Denote by \(V(N)\) the vertices in \(B(N)\). We shall prove the above differential inequalities in \(B(N)\), and then take \(N\rightarrow \infty \).
Impose periodic boundary conditions on \(B(N)\) by identifying its opposite faces. Denote this finite lattice by \({\mathbb {L}}(N)\). Denote the intersection of \({\mathbb {L}}(N)\) and \({\mathbb {L}}_0\) by \({\mathbb {L}}_0(N)\). Denote the set of edges in \({\mathbb {L}}_0(N)\) by \({\mathbb {E}}_0(N)\) and the set of edges in \({\mathbb {L}}(N)\) by \({\mathbb {E}}(N)\).
As before, edges in \({\mathbb {E}}(N)\setminus {\mathbb {E}}_0(N)\) are open with the bulk probability \(p\), and edges in \({\mathbb {E}}_0(N)\) are open with surface probability \(\sigma \).
The open cluster in \({\mathbb {L}}(N)\) at the vertex \(x\) is \(C_N(x)\), and the open cluster at the origin is \(C_N(0) \equiv C_N\). For \(y\in V(N)\), define the susceptibility \(\chi _N^I (p,\sigma ;y) = E^I_{p,\sigma } |C_N(y)| \).
Introduce the ghost vertex \(g\) and edges \({{\mathbb {E}}_g (N) = \{g{\sim }x|\, x\in V(N)\}}\). Edges in \({\mathbb {E}}_g(N)\) are open with probability \(\gamma \in (0,1)\). Define \(G_N\) to be the collection of vertices in \({\mathbb {L}}(N)\) adjacent to \(g\) through open edges in \({\mathbb {E}}_g(N)\).
For inhomogeneous percolation on \({\mathbb {E}}(N) \cup {\mathbb {E}}_g(N)\) with parameters \((p,\sigma ,\gamma )\), let \(P^I_{p,\sigma ,\gamma }\) and \(E^I_{p,\sigma ,\gamma }\) be the corresponding probability measure and expectation. For \(y\in {\mathbb {L}}(N)\), we define the associated quantities
That is, \(\theta ^I_N(p,\sigma ,\gamma ;y)\) is the probability that there is an open path from \(y\) to \(g\). Also write
Then \(\theta _N^I(p,\sigma ,\gamma ) = \theta _N^I(p,\sigma ,\gamma ;y)\) for all \(y \in {\mathbb {L}}_0(N)\), and similarly for \(\chi ^I_N\). We shall frequently simplify notation by leaving out the arguments when there is no risk of ambiguity, e.g. \(\theta _N^I \equiv \theta _N^I(p,\sigma ,\gamma )\). We have
We immediately obtain the following analogue of Eq. (27):
The functions \(\theta ^I (p,\sigma ,\gamma )\) and \(\chi ^I (p,\sigma ,\gamma )\) are defined in the usual way for the infinite lattice \({\mathbb {L}}\) with the ghost vertex \(g\) and edges \({\mathbb {E}}_g\), and with \({\mathbb {L}}_0\) as defined before:
where \(C\) is the cluster at the origin. Note that for \(\gamma >0\), \(C \cap G\) is not empty with probability one when \(|C|=\infty \).
The proof of the following lemma is similar to the proof for homogeneous percolation in appendix I of reference [19].
Lemma 6
For all \(\gamma \in (0,1)\) and \(p,\sigma \in (0,1)\),
and similarly,
\(\square \)
By Eqs. (27) and (99) and Lemma 6, we have
1.1 Uniform Bounds for Vertex-Dependent Functions
Let \(P^H_{p,\gamma }\) and \(E^H_{p,\gamma }\) be the probability measure and expectation for homogeneous percolation with a ghost field. Let \(\chi _N^H(p,\gamma ) = E^H_{p,\gamma } (|C_N|{1}\!\mathrm{l}\{ C_N\cap G_N = \emptyset \})\) be the corresponding susceptibility in \(B(N)\). Also let \(\chi _N^H(p) = \chi ^H_N(p,0)\).
Proving the differential inequalities requires the following useful lemma.
Lemma 7
Assume \(p\le \sigma \) and \(y\in B(N)\). Then
-
(a)
\(\theta _N^I (p,\sigma ,\gamma ;y) \;\le \; \chi _N^H(p) \, \theta _N^I (p,\sigma ,\gamma )\) for every \(\gamma \in (0,1)\);
-
(b)
\(\chi _N^I(p,\sigma ;y) \;\le \; \chi _N^H(p) \,\chi _N^I(p,\sigma ;0)\) (where \(\chi _N^I(p,\sigma ;y):=\chi _N^I(p,\sigma ,0;y)\)).
Proof
Since \(\chi _N^H(p) \ge 1\), it is only necessary to consider the case that \(y\not \in {\mathbb {L}}_0(N)\).
(a) Suppose that \(C_N(y) \cap G_N \not = \emptyset \). Then there is an open path from \(y\) to a point of \(G_N\). This path either uses no edge of \({\mathbb {E}}_0(N)\), or there exists an open self-avoiding path \(\pi \) from \(y\) to a vertex of \(G_N\) which passes through an edge of \({\mathbb {E}}_0(N)\). In the latter case, let \(z\) be the earliest point of \(\pi \) that is an endpoint of a bond in \(\pi \cap {\mathbb {L}}_0(N)\). Then \(z\in {\mathbb {L}}_0(N)\), and the part of \(\pi \) from \(y\) to \(z\) is disjoint from the part of the path from \(z\) to a vertex of \(G_N\).
We formalize the above as follows. For given fixed \(y\) and for each \(z\in {\mathbb {L}}_0(N)\), define the events
-
\(\widetilde{A}_N\) is the event that there is an open path from \(y\) to \(G_N\) in \({\mathbb {E}}(N)\setminus {\mathbb {E}}_0(N)\);
-
\(\widetilde{D}_N(z)\) is the event that there is an open path from \(y\) to \(z\) in \({\mathbb {E}}(N)\setminus {\mathbb {E}}_0(N)\);
-
\(D^*_N(z)\) is the event that there is an open path from \(z\) to \(G_N\) in \(B(N)\).
Observe that
Using standard percolation notation, \(\widetilde{D}_N(z) \circ D^*_N(z)\) is the event that \(\widetilde{D}_N(z)\) and \(D^*_N(z)\) occur disjointly—that is, there exist two disjoint sets of open edges such that the first set guarantees occurrence of \(\widetilde{D}_N(z)\) and the second set guarantees occurrence of \(D^*_N(z)\).
We then observe that
since occurrence of of the event \(\left\{ C_N(y) \cap G_N \not = \emptyset \right\} \) implies that either \(\widetilde{A}_N\) occurs or \(\left( \widetilde{D}_N(z) \circ D^*_N(z) \right) \) occurs for some \(z\in {\mathbb {L}}_0(N)\).
From Eqs. (102) and (101) and the BK Inequality [19], we see that
(b) Fix \(y\in {\mathbb {L}}(N)\setminus {\mathbb {L}}_0(N)\). Let \(\widetilde{D}_N(z)\) be defined as in part (a). For \(w\in B(N)\), let \(\left\{ y \leftrightarrow _N w \right\} \) denote the event that \(y\) and \(w\) are connected in \(B(N)\) by a path of open edges.
Similarly to the proof of part (a), we see that for each \(w\in B(N)\)
Since \(p\le \sigma \), we have \(\chi _N^H(p) \le \chi _N^I(p,\sigma ;0) = \chi ^I_N(p,\sigma ;z)\) for every \(z\in {\mathbb {L}}_0(N)\). Using this and summing Eq. (103) over \(w\), we obtain
This completes the proof. \(\square \)
1.2 The First Differential Inequality
The first differential inequality is defined in terms of \(\theta _N^I \equiv \theta ^I_N(p,\sigma ,\gamma )\) as follows.
Lemma 8
For \(p,\sigma ,\gamma \in (0,1)\), let \(\mathbf {p} = (p,\sigma )\) and \(\nabla \equiv \left( \frac{\partial }{\partial p}, \frac{\partial }{\partial \sigma }\right) \). Define \(\mathbf {q} = \mathbf {1}-\mathbf {p} = (1-p,1-\sigma )\). If \(p \le \sigma \), then we have
Proof
The proof is similar to the proof for homogeneous percolation (see for example reference [19]) and proceeds by applying Russo’s formula to the event \(\{ C_N \cap G_N \not = \emptyset \}\), conditioned on \(G_N\).
Let \(\Gamma \) be a realisation of \(G_N\), i.e. a subset of vertices of \(B(N)\). The event \(A_N (\Gamma ) = \{ C_N \cap \Gamma \not =\emptyset \}\) is increasing. Hence by Russo’s formula [19],
First consider Eq. (104). An edge \(e=x{\sim }y\) is pivotal for \(A_N (\Gamma )\) if and only if the following all occur in \({\mathbb {E}}(N) \setminus \{e\}\): (1) there is no open path from the origin to \(\Gamma \), (2) exactly one of \(x\) and \(y\) is joined to the origin by an open path, and (3) the other vertex is joined to a vertex of \(\Gamma \) by an open path. Hence,
where the last summation is over all ordered pairs \((x,y)\) of vertices such that the (undirected) edge \(x{\sim }y\) is in \({\mathbb {E}}(N) \setminus {\mathbb {E}}_0(N)\). Put \(q=1-p\) and average the left hand side of the above over \(\Gamma \):
Here it is important that the sum over \(\Gamma \) has a finite number of terms.
This shows that
Observe that \(C_N\) and \(C_N(y)\) must be disjoint on the right hand side.
Exactly the same set of arguments applied to Eq. (105) gives (with \(\tau = 1-\sigma \))
Adding the last two equations together then produces
The right hand side of Eq. (107) must be bounded next. This is done by conditioning on the cluster at the origin. The last equation becomes
where the outer sum is over ordered pairs \((x,y)\) such that \(x{\sim }y\in {\mathbb {E}}(N)\), and the inner sum is over all connected graphs \(\Xi \) containing \(\{0,x\}\) and not containing \(y\).
Conditioned on \(C_N=\Xi \), the events \(C_N \cap G_N = \emptyset \) and \(C_N(y)\cap G_N \not =\emptyset \) are independent (the first depends only on vertices of \(\Xi \), and the second depends only on vertices and edges outside \(\Xi \)). Hence
The condition \(C_N = \Xi \) in the last factor restricts the set of possible open paths from \(y\) to a vertex in \(G_N\) (since \(y\not \in C_N\)). Hence
This shows that
where the final inequality comes from Lemma 7(a). It remains to bound the last summation.
by Eqs. (98) and (99). Putting this all together then gives the desired inequality. \(\square \)
1.3 The Second Differential Inequality
The second differential inequality is the following (again writing \(\theta _N^I\) for \(\theta _N^I(p,\sigma ,\gamma )\)).
Lemma 9
For \(p,\sigma ,\gamma \in (0,1)\) let \(\mathbf {p} = (p,\sigma )\) and \(\nabla \equiv \left( \frac{\partial }{\partial p}, \frac{\partial }{\partial \sigma }\right) \). If \(p \le \sigma \), then
Proof
Observe that
The first term in Eq. (110) can calculated:
by Eq. (99).
It remains to bound the second term in (110). Define the event
Then \(A_x \circ A_x\) is the event that there exist two distinct vertices \(v_1\) and \(v_2\) in \(G_N\) and two edge-disjoint open paths joining these vertices to \(x\). If \(x\in G_N\), then one these paths may be the singleton \(x\).
It follows that
By the BK inequality,
The remaining term is the probability that \(\left| C_N \cap G_N \right| \ge 2\) but there do not exist two edge-disjoint paths from the origin to distinct vertices in \(G_N\). If this occurs, then there exists an edge \(x{\sim }y\) in \({\mathbb {E}}(N)\) with the following properties:
-
\(x{\sim }y\) is open;
-
If \(x{\sim }y\) is deleted in \({\mathbb {L}}(N)\), then three events occur:
-
1.
there is no open path from the origin to a vertex of \(G_N\);
-
2.
\(x\) is joined to the origin by an open path;
-
3.
the event \(A_y\circ A_y\) occurs.
-
1.
The probability that a particular edge \(x{\sim }y\) has these properties is
if \(x{\sim }y \in {\mathbb {E}}(N)\setminus {\mathbb {E}}_0(N)\); if \(x{\sim }y \in {\mathbb {E}}_0(N)\), then we get the above expression with \(\sigma (1-\sigma )^{-1}\) instead of \(pq^{-1}\). Therefore we obtain the bound
where
writing \(\tau = 1-\sigma \).
Consider a summand from Eq. (114) and (115) conditioned on \(C_N=\Xi \), with \(x\in \Xi \) and \(y\not \in \Xi \). Using conditional independence of the events \(A_y\) and \(\{ C_N \cap G_N = \emptyset \}\), and the BK inequality, we obtain
Substitute this into Eq. (114) and average over \(\Xi \). This gives the upper bound
Next, by Eq. (106) and Lemma 7(a), we obtain (with \(\theta _N^I(p,\sigma ,\gamma )\equiv \theta _N^I\))
The analogous bound for Eq. (115) is
Hence,
Putting this together with Eqs. (110), (112), (111) and (113) completes the proof of the desired inequality. \(\square \)
1.4 The Final Differential Inequalities
To complete the proof of the two differential inequalities (29) and (30), we take the \(N\rightarrow \infty \) limit in Lemmas 8 and 9. Using Lemma 6 and Eq. (100), the result is the following theorem.
Theorem 8
For \(p,\sigma ,\gamma \in (0,1)\), write \(\mathbf {p} = (p,\sigma )\), \(\nabla \equiv \left( \frac{\partial }{\partial p}, \frac{\partial }{\partial \sigma }\right) \), \(\mathbf {q} = \mathbf {1}-\mathbf {p} = (1{-}p,1{-}\sigma )\), and \(\theta ^I \equiv \theta ^I(p,\sigma ,\gamma )\). If \(p \le \sigma \), then
Rights and permissions
About this article
Cite this article
Iliev, G.K., Janse van Rensburg, E.J. & Madras, N. Phase Diagram of Inhomogeneous Percolation with a Defect Plane. J Stat Phys 158, 255–299 (2015). https://doi.org/10.1007/s10955-014-1125-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-014-1125-5