Abstract
In this paper, we consider nearest-neighbor oriented percolation with independent Bernoulli bond-occupation probability on the d-dimensional body-centered cubic (BCC) lattice \({\mathbb {L}^d}\) and the set of non-negative integers \({{\mathbb {Z}}_+}\). Thanks to the orderly structure of the BCC lattice, we prove that the infrared bound holds on \({\mathbb {L}^d} \times {{\mathbb {Z}}_+}\) in all dimensions \(d\ge 9\). As opposed to ordinary percolation, we have to deal with complex numbers due to asymmetry induced by time-orientation, which makes it hard to bound the bootstrap functions in the lace-expansion analysis. By investigating the Fourier–Laplace transform of the random-walk Green function and the two-point function, we derive the key properties to obtain the upper bounds and resolve a problematic issue in Nguyen and Yang’s bound. The issue is caused by the fact that the Fourier transform of the random-walk transition probability can take the value \(-1\).
Similar content being viewed by others
Data Availability
Yes.
Code Availability
One can download it from the third author’s repository https://gitlab.com/ykami/comp-lace_for_op.
References
Aizenman, M., Barsky, D.J.: Sharpness of the phase transition in percolation models. Commun. Math. Phys. 108, 489–526 (1987)
Aizenman, M., Newman, C.M.: Tree graph inequalities and critical behavior in percolation models. J. Stat. Phys. 36, 107–143 (1984)
Barsky, D.J., Aizenmman, M.: Percolation critical exponents under the triangle condition. Ann. Probab. 19, 1520–1536 (1991)
Bezuidenhout, C., Grimmett, G.: The critical contact process dies out. Ann. Probab. 18, 1462–1482 (1990)
Borgs, C., Chayes, J.T., van der Hofstad, R., Slade, G., Spencer, J.: Random subgraphs of finite graphs. II. The lace expansion and the triangle condition. Ann. Probab. 33, 1886–1944 (2005)
Broadbent, S.R., Hammersley, J.M.: Percolation processes. I. Crystals and mazes. Proc. Camb. Philos. Soc. 53, 629–641 (1957)
Brydges, D.C., Spencer, T.: Self-avoiding walk in 5 or more dimensions. Commun. Math. Phys. 97, 125–148 (1985)
Chayes, J.T., Chayes, L.: Inequality for the infinite-cluster density in Bernoulli percolation. Phys. Rev. Lett. 56, 1619–1622 (1986)
Chen, L.-C., Sakai, A.: Critical behavior and the limit distribution for long-range oriented percolation. I. Probab. Theory Relat. Fields 142, 151–188 (2008)
Duminil-Copin, H., Tassion, V.: A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. Commun. Math. Phys. 343, 725–745 (2016)
Duminil-Copin, H., Tassion, V., Teixeira, A.: The box-crossing property for critical two-dimensional oriented percolation. Probab. Theory Relat. Fields 171, 685–708 (2018)
Fitzner, R., van der Hofstad, R.: Mean-field behavior for nearest-neighbor percolation in \(d>10\). Electron. J. Probab. 22 (2017) arXiv:1506.07977
Fitzner, R., van der Hofstad, R.: Generalized approach to the non-backtracking lace expansion. Probab. Theory Relat. Fields 169, 1041–1119 (2017)
Grassberger, P.: Logarithmic corrections in \((4+1)\)-dimensional directed percolation. Phys. Rev. E 79, 052104 (2009)
Grimmett, G.: Percolation, 2nd edn. Springer, New York (1999)
Grimmett, G., Hiemer, P.: Directed percolation and random walk. In and Out of Equilibrium (ed., V. Sidoravicius) Birkhäuser (2002): 273–297
Handa, S., Kamijima, Y., Sakai, A.: A survey on the lace expansion for the nearest-neighbor models on the BCC lattice. Taiwan. J. Math. 24, 723–784 (2020)
Hara, T., Slade, G.: Mean-field critical behavior for percolation in high dimensions. Commun. Math. Phys. 128, 333–391 (1990)
Hara, T., Slade, G.: Mean-field behaviour and the lace expansion. In: Grimmett, G.R. (ed.) Probability and Phase Transition, pp. 87–122. Kluwer, Rijin (1994)
Hara, T., Slade, G.: The self-avoiding-walk and percolation critical points in high dimensions. Comb. Probab. Comput. 4, 197–215 (1995)
Heydenreich, M., van der Hofstad, R.: Progress in High-Dimensional Percolation and Random Graphs. Springer, Cham (2017)
Heydenreich, M., Matzke, K.: Expansion for the critical point of site percolation: the first three terms. Comb. Probab. Comput. 31, 430–454 (2022)
Janssen, H., Stenull, O.: Logarithmic corrections in directed percolation. Phys. Rev. E 69, 016125 (2004)
Kamijima, Y.: Mean-field behavior for percolation models. Ph.D. thesis, Hokkaido University (2021). https://doi.org/10.14943/doctoral.k14347
Kamijima, Y.: Mean-field behavior of nearest-neighbor oriented percolation on \({\mathbb{Z}}^{d\ge 183}\times {\mathbb{Z}}_+\)
Menshikov, M.V.: Coincidence of critical points in percolation problems. Soviet Math. 33, 856–859 (1986)
Nguyen, B.G., Yang, W.-S.: Triangle condition for oriented percolation in high dimensions. Ann. Probab. 21, 1809–1844 (1993)
Nguyen, B.G., Yang, W.-S.: Gaussian limit for critical oriented percolation in high dimensions. J. Stat. Phys. 78, 841–876 (1995)
Obukhov, S.P.: The problem of directed percolation. Physica 101A, 145–155 (1980)
Ódor, G.: Universality classes in nonequilibrium lattice systems. Rev. Mod. Phys. 76, 663–724 (2004)
Russo, L.: On the critical percolation probabilities. Z. Warsch. Verw. Geb. 56, 229–237 (1981)
Sakai, A.: Mean-field critical behavior for the contact process. J. Stat. Phys. 104, 111–143 (2001)
Sakai, A.: Diagrammatic bounds on the lace-expansion coefficients for oriented percolation. (2007). arXiv:0708.2897
Sakai, A.: Hyperscaling for oriented percolation in \(1+1\) space-time dimensions. J. Stat. Phys. 171, 462–469 (2018)
Schertzer, E., Sun, R., Swart, J.: The Brownian Web, the Brownian Net, and their Universality. In: Contucci, P., Giardinà, C. (eds.) Advances in Disordered Systems. Random Processes and Some Applications, pp. 270–368. Cambridge University Press, Cambridge (2016)
Slade, G.: The Lace Expansion and its Applications. Lecture Notes in Mathematics, vol. 1879. Springer, Berlin (2006)
Toulouse, G.: Perspectives from the theory of phase transitions. Nuovo Cimento 23B, 234–240 (1974)
van den Berg, J., Kesten, H.: Inequalities with applications to percolation and reliability. J. Appl. Probab. 22, 556–569 (1985)
van der Hofstad, R., Sakai, A.: Critical points for spread-out self-avoiding walk, percolation and the contact process above the upper critical dimensions. Probab. Theory Relat. Fields 132, 438–470 (2005)
van der Hofstad, R., Slade, G.: A generalised inductive approach to the lace expansion. Probab. Theory Relat. Fields 122, 389–430 (2002)
van der Hofstad, R., Slade, G.: Convergence of critical oriented percolation to super-Brownian motion above \(4+1\) dimensions. Ann. Inst. H. Poincaré Prob. Stat. 39, 413–485 (2003)
van der Hofstad, R., Slade, G.: Asymptotic expansions in \(n^{-1}\) for percolation critical values on the \(n\)-cube and \({\mathbb{Z} }^n\). Random Struct. Algorithms 27, 331–357 (2005)
van der Hofstad, R., Slade, G.: Expansion in \(n^{-1}\) for percolation critical values on the \(n\)-cube and \({\mathbb{Z} }^n\): The first three terms. Comb. Probab. Comput. 15, 695–713 (2006)
Acknowledgements
YK and SH are grateful to the National Center for Theoretical Sciences (NCTS) for providing his support and hospitality during his visit to National Chengchi University (NCCU) in the period May–June 2018. YK is also grateful for the financial support from NCCU during the visits from November 5–17, 2018, and from December 17–27, 2019. The work of LCC was supported by the Grant MOST 109-2115-M-004-010-MY3. Finally, we would like to thank Akira Sakai and the anonymous referee for their many valuable comments regarding an earlier version of this paper.
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
All authors contributed equally to this work.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical Approval
Not applicable.
Consent to Participate
Not applicable.
Consent for Publication
Yes.
Appendices
Appendix A: Random Walk Quantities on the BCC Lattice
In this section, we show the expressions of the upper bounds on (1.2) to compute their numerical values. We use Stirling’s formula due to the property (1.1) of the BCC lattice, which helps us to obtain highly-precise estimates. Recall (1.1). Note that
for \(n\in {\mathbb {N}}\). Now, fix a sufficiently large number N. For \(\nu \in {\mathbb {N}}\), (A.1) and the bounds given by the integral test for convergence imply that
Moreover,
When \(N=500\), we obtain numerical values in Table 1 by directly computing these expressions.
Proof of Lemma 2.3
In this section, we prove Lemma 2.3. It is the result of Lemma 6.1 below. In this lemma, we first divide percolation events by cases, which are based on the fact of whether or not double connections are collapsed and where a path intersects a double connection. Next, these observations yield a lot of disjoint events such as \(\lbrace \varvec{x} \rightarrow \varvec{y}\rbrace \circ \lbrace \varvec{u} \rightarrow \varvec{v}\rbrace \), where \(\circ \) denotes that the left and right events must occur disjointly. Then, by the BK inequality [38], we bound the probability of such events in terms of the product of the two-point functions, e.g.,
Such a product is represented by a diagram like (2.6). Also, the method to obtain Lemma 2.3 from Lemma 6.1 is based on decomposing diagrams by the inequality
where f and g are functions depending on a sum of a product of the two-point functions.
Lemma 6.1
For \({\varvec{x}\in {\mathbb {L}^d} \times {{\mathbb {Z}}_+}}\) and \(N\ge 2\),
Proof of (B.2) in Lemma 6.1
This proof is inspired by [39, Sect. 3.1]. First, we rewrite the event in \(\pi _p^{(0)}(\varvec{x})\). To do so, we introduce an ordering among bonds as follows. Let \({{\mathscr {B}}((x, t)) = \{((x, t), (y, t+1)) \in ({\mathbb {L}^d} \times {{\mathbb {Z}}_+})^2 \mid x - y \in {\mathscr {N}}^d\}}\) for \({(x, t) \in {\mathbb {L}^d} \times {{\mathbb {Z}}_+}}\), which is the set of directed bonds whose bottoms are (x, t). We can order the elements in \({\mathscr {B}}((x, t))\) because it is a finite set. For a pair of bonds \(\varvec{b}_1\) and \(\varvec{b}_2\), we write \(\varvec{b}_1 \prec \varvec{b}_2\) if \(\varvec{b}_1\) is smaller than \(\varvec{b}_2\) in that ordering. Then, we obtain
Next, we rewrite the event in \(\pi _p^{(1)}(\varvec{x})\). By definition, we can easily see that
By splitting the event \(\lbrace \varvec{o} \Rightarrow \underline{\varvec{b}}\rbrace \) into two events based on whether \(\underline{\varvec{b}}\) equals \(\varvec{o}\) or not,
Since both
and
are the whole event, respectively,
By (B.5), taking the sum of the above over \(\varvec{b} \in {\mathscr {B}}(\varvec{o})\) yields
Substituting (B.8) into (B.7) and subtracting (B.5), we obtain
Finally, we show how (B.9) leads to the upper bound (B.2). In the following, we repeatedly use the trivial inequality
and the fact that, if there are two disjoint connections, then their lengths are at least two for oriented percolation. By Boole’s and the BK inequalities, (a) in (B.9) is bounded above as
which corresponds to the 1st term in (B.2). The factor 1/2 in the last line is due to ignoring the ordering. To bound (b) in (B.9), we note that, for \(\varvec{b}\in {\mathscr {B}}(\varvec{o})\),
By Boole’s and the BK inequalities, we have
which corresponds to the 2nd term in (B.2). To bound (c) in (B.9), we note that, for \(\varvec{b}\in {\mathscr {B}}(\varvec{o})\),
By Boole’s and the BK inequalities, we have
Each term in the above upper bound corresponds to contributions of the 3rd term, the 4th term, the 5th term, the 4th term and the 6th term in (B.2), respectively. To bound (d) in (B.9), we apply (B.6) and split the below event into two events based on where the branching point is assigned:
Then, we obtain
Applying the BK [38] inequality and the same method for (a) to the right-most in the above, and paying attention to the disjointness of the connections, we arrive at
Each term in the above upper bound corresponds to contributions of the 3rd term, the 4th term and the 5th term in (B.2), respectively. Combining the upper bounds on (a)–(d) completes the proof of (B.2). \(\square \)
Proof of (B.3) in Lemma 6.1
It is not hard to prove the upper bound by using (B.6), (B.11) and (B.14), so that we omit it. \(\square \)
Proof of (B.4) in Lemma 6.1
By definition,
Paying attention to the disjointness of connections and the magnitude relationship between times, we obtain
By applying (B.14) to the above repeatedly,
Finally, using Boole’s and the BK [38] inequality, and applying a similar method to (B.2), we arrive in (B.4). \(\square \)
Multiplying the diagrammatic bounds in Lemma 6.1 by the factors \(m^t\), t or \(1 - \cos k\cdot x\), and taking the sum of them, we obtain Lemma 2.3. The upper bounds (2.13)–(2.9) also require a telescopic inequality for the cosine function. Since its proof is quite the same as the literature, we omit it.
Lemma 6.2
([12, Lemma 2.13] or [21, Lemma 7.3]) Let \(J\ge 1\) and \(t_j\in {\mathbb {R}}\) for \(j=1, \dots , J\). Then,
Sketch proof of Lemma 2.3
We only deal with three examples of the bounds on the sum of a diagram multiplied by the factors \(m^t\), t or \(1 - \cos k\cdot x\) because one can easily calculate the other bounds on the analogy of such examples. The following proof is almost identical to the proof of [17, Lemma 5.3].
First, we consider the bounds (2.7)–(2.9). By the translation-invariance, for example,
which corresponds to the last term in the right hand side in (2.7). In the second equality, we have used the translation invariance.
Next, we consider the bounds (2.10)–(2.12). Note that
By using the above inequalities, for example,
which corresponds to the 5th term in the right hand side in (2.11).
Finally, we consider (2.13)–(2.15). By Lemma 6.2, for example,
which corresponds to the last term on the right hand side in (2.14). \(\square \)
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chen, LC., Handa, S. & Kamijima, Y. Mean-field behavior of Nearest-Neighbor Oriented Percolation on the BCC Lattice Above 8 + 1 Dimensions. Math Phys Anal Geom 26, 4 (2023). https://doi.org/10.1007/s11040-022-09441-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11040-022-09441-6