Preprint
Article

Stabilization of Percolation Probability in Supercritical Regimes: A Measure Theoretic Approach

Altmetrics

Downloads

40

Views

22

Comments

0

This version is not peer-reviewed

Submitted:

20 September 2024

Posted:

20 September 2024

You are already at the latest version

Alerts
Abstract
In this paper, we present a rigorous proof demonstrating the stabilization of percolation probability in supercritical regimes for percolation models. We analyze a sequence of expanding compact balls in ℝ௡, incorporating correction terms that vanish asymptotically, and show that the percolation probability within these regions converges to a finite, non‐zero value as the balls expand to cover the entire space. Our approach combines key concepts from percolation theory with measure‐theoretic tools, such as the Monotone Convergence Theorem and Fatouʹs Lemma, to rigorously establish the existence and uniqueness of the limiting percolation probability. The result extends classical results on percolation probability in lattice models and provides a new framework for understanding convergence in infinite systems. The non‐triviality of the limit is demonstrated in the supercritical regime, where percolation occurs with positive probability. The framework introduced here could serve as a bridge between discrete and continuous models in statistical physics
Keywords: 
Subject: Computer Science and Mathematics  -   Mathematics

1. Introduction

Percolation theory, which investigates the behavior of connected clusters in random graphs or lattices, has been a fundamental area of study in statistical physics, mathematics, and complex systems. Since its introduction by Broadbent and Hammersley in 1957, percolation theory has been applied in a variety of fields, ranging from material science to epidemiology and network theory theory (Broadbent & Hammersley, 1957). In particular, it is used to model phenomena such as fluid flow through porous media, the spread of diseases, and the robustness of networks(Stauffer & Aharony, 1994; Bollobás & Riordan, 2006). One of the key questions in percolation theory is determining the critical threshold, p c , which separates the subcritical and supercritical regimes of connectivity in a given system. Below p c , clusters remain small and localized, while above p c , a giant connected cluster emerges, enabling large-scale connectivity (Grimmett, 1999).
In the supercritical regime (i.e., when p > p c ), it is well-known that the probability of forming an infinite cluster in infinite lattice models is non-trivial. The percolation probability, θ ( p ) , quantifies the likelihood that a given node or site is part of this infinite cluster. Classical results, such as those of Kesten (1982) and Grimmett (1999), have established rigorous frameworks for understanding the behavior of percolation in finite and infinite systems, particularly in lattice models like Z d . However, the study of measure-theoretic aspects of percolation, especially how percolation probabilities stabilize as one considers expanding regions in continuous spaces, remains a less-explored area (Durrett, 2010). In this paper, we aim to address this gap by developing a rigorous measure-theoretic approach to the stabilization of percolation probabilities.
Our focus is on a sequence of compact regions, modeled as balls B d n + s in R n , where the radii d n as n , and the correction terms s 0 vanish asymptotically. We aim to demonstrate that, in the supercritical regime, the percolation probability inside these regions converges to a finite, non-zero value as the balls expand to cover the entire space. This approach draws upon measure theory, specifically using tools like the Monotone Convergence Theorem and Fatou's Lemma, to rigorously analyze the limiting behavior of percolation probabilities in large-scale systems.
While percolation on infinite lattices has been studied extensively using combinatorial and probabilistic methods, our approach introduces a new perspective by leveraging measure-theoretic results. The Monotone Convergence Theorem (MCT) (Royden & Fitzpatrick, 2010), as described in standard texts such as Billingsley (1995), provides a powerful framework for analyzing sequences of increasing sets, particularly in relation to their probability measures. Additionally, Fatou's Lemma(Rudin, 1987), a fundamental result in measure theory, allows us to handle cases where the sequence of regions may not be strictly increasing, thereby ensuring that the limit inferior of the percolation probability is bounded below by the percolation probability of the limit set.
The stabilization of percolation probability has important implications not only for theoretical physics but also for applied fields such as network theory and statistical mechanics. In particular, understanding how percolation probabilities behave in large-scale or infinite systems is crucial for modeling phenomena that depend on long-range connectivity, such as the resilience of large networks or the spread of information or diseases(Newman, 2010; Albert & Barabási, 2002).
In this paper, we present a step-by-step formal proof that addresses the stabilization of percolation probability in the supercritical regime, extending classical results by embedding them within a measure-theoretic framework. We begin by defining the sequence of expanding regions, modeling their percolation probabilities using indicator functions, and applying MCT and Fatou's Lemma to establish the non-triviality and uniqueness of the limit. We conclude with a discussion of the implications of our results for both continuous and discrete percolation models.

2. Methodology and Problem Statement

Let B d n + s represent a sequence of compact balls in R n , where d n as n , and s 0 is a correction term. We aim to prove that the percolation probability inside these balls stabilizes to a finite, non-zero value as n .
Define the percolation probability for the ball B d n + s as P B d n + s . Our goal is to show:
l i m n P B d n + s = L
where 0 < L < 1 , assuming the system is in the supercritical regime of percolation [Grimmett, 1999].

2.1. Assumptions

  • The system has a well-defined critical probability p c , which separates subcritical (nonpercolating) from supercritical (percolating) regimes [Kesten, 1982].
  • P B d n + s represents the probability of a percolating cluster forming inside the ball B d n + s .
  • The probability space ( Ω , F , P ) is properly defined for the percolation model, and all relevant events are measurable.
  • The system is supercritical, meaning p > p c , where θ ( p ) is the probability of the infinite cluster in the infinite lattice [Grimmett, 1999].

3. Preliminary Lemmas

Lemma 1 (Monotonicity in Percolation Models)
In standard percolation models on lattices, the sequence of balls B d n + s is inherently increasing as n .
Proof: Consider two consecutive balls B d n + s n and B d n + 1 + s n + 1 . Since d n , we have d n + 1 > d n for all sufficiently large n . Given that s n , s n + 1 0 , there exists an N such that for all n > N :
B d n + s n B d n + 1 + s n + 1
Thus, the sequence of balls is increasing.

4. Main Proof

Step 1: Definition of Indicator Functions
Let f n ( x ) be the indicator function corresponding to percolation inside the ball B d n + s , defined as:
f n ( x ) = 1 B d n + s ( x )
where:
f n ( x ) = 1   if   percolation   occurs   inside   B d n + s 0   otherwise  
The percolation probability is then given by the expectation of f n ( x ) :
P B d n + s = E f n ( x ) = Ω f n ( x ) d P ( x )
Step 2: Monotone Convergence Theorem (MCT) Application
By Lemma 1 , we know that the sequence of balls B d n + s is increasing for sufficiently large n . Consequently, the sequence of indicator functions f n ( x ) is monotonically increasing:
f 1 ( x ) f 2 ( x )
By the Monotone Convergence Theorem (MCT) [Billingsley, 1995], we have:
l i m n Ω f n ( x ) d P ( x ) = Ω l i m n f n ( x ) d P ( x )
Since l i m n f n ( x ) = 1 B ( x ) for some limiting set B , this implies:
l i m n P B d n + s = P B
where B represents the limiting set as n .
Step 3: Fatou's Lemma Application for Non-Monotonic Sequences
While we have established monotonicity, for completeness, we consider the case where the sequence might not be strictly increasing. Applying Fatou's Lemma [Billingsley, 1995]:
Ω l i m i n f n f n ( x ) d P ( x ) l i m i n f n Ω f n ( x ) d P ( x )
In the context of percolation, this implies:
P l i m i n f n B d n + s l i m i n f n P B d n + s
This guarantees that even if the sequence is not increasing, the limit inferior of the percolation probability is bounded below by the probability of the limiting set.
Step 4: Asymptotic Behavior of Corrections
Lemma 2 (Vanishing Corrections)
For any ε > 0 , there exists an N such that for all n > N :
P B d n + s P B d n < ε
Proof: Define the symmetric difference Δ n = B d n + s Δ B d n . As s 0 , the volume of Δ relative to B d n tends to 0 as n . By the continuity of measure, P Δ n 0 as n . Therefore:
P B d n + s P B d n P Δ n 0   as   n
Hence, the effect of s becomes negligible in the limit, justifying our treatment of s = 0 for large n
Step 5: Final Proof
Combining the Monotone Convergence Theorem (for increasing sequences) and Fatou's Lemma (for non-monotonic sequences), we conclude that:
l i m n P B d n + s = P B
where B is the limiting set as n .
Step 6: Supercritical Regime and Non-triviality of the Limit
In the supercritical regime p > p c [Kesten, 1982], we know that:
  • There exists an infinite cluster with positive probability θ ( p ) > 0 [Grimmett, 1999].
  • The probability of an infinite cluster is less than 1 for p < 1 .
Step 6: Supercritical Regime and Non-triviality of the Limit
In the supercritical regime p > p c [Kesten, 1982], we know that:
  • There exists an infinite cluster with positive probability θ ( p ) > 0 [Grimmett, 1999].
  • The probability of an infinite cluster is less than 1 for p < 1 .
Therefore, for any sequence of increasing balls B d n + s :
  • P B d n + s θ ( p ) > 0 for all n , as each ball has at least the probability of containing a point from the infinite cluster.
  • P B d n + s < 1 for all finite n , as there is always a positive probability of no percolation in a finite region.
Thus, 0 < θ ( p ) L 1 , where L is our limit, ensuring 0 < L < 1 .
5. Main Theorems
Theorem 1 (Stabilization of Percolation Probability)
If the system is supercritical, then the percolation probability within the sequence of compact balls B d n + s converges to a finite, non-zero value as n :
l i m n P B d n + s = L
where 0 < L < 1 .
Theorem 2 (Uniqueness of the Limit)
The limit L = l i m n P B d n + s is unique and independent of the specific sequence d n chosen, as long as d n .
Proof sketch:
  • Consider two sequences d n and d n ' with d n , d n ' .
  • For any ε > 0 , there exists N such that for all n > N , B d n and B d n ' both contain any fixed finite subset of the lattice with probability > 1 ε .
  • This implies that P B d n P B d n ' < 2 ε for all n > N .
  • As ε is arbitrary, the limits must coincide.
This completes the formal proof that the percolation probability stabilizes to a finite, non-zero value in the limit. Our approach provides a measure-theoretic foundation for the existence and nontriviality of the percolation probability θ ( p ) in the supercritical regime. This result extends classical theorems such as Kesten's theorem for bond percolation on Z d and bridges discrete percolation models with continuous measure spaces.

3. Discussion

In this paper, we have established the stabilization of percolation probability in the supercritical regime using a rigorous measure-theoretic framework. By considering a sequence of expanding compact balls B d n + s in R n , we demonstrated that the percolation probability within these regions converges to a finite, non-zero value as the sequence grows, provided the system is supercritical ( p > p c ). Our approach, which relied on the Monotone Convergence Theorem and Fatou's Lemma, ensures that the percolation probability not only stabilizes but also remains bounded between the probability of an infinite cluster forming and one, confirming the non-triviality of the limit.
The application of measure-theoretic tools to percolation models extends classical results in percolation theory, such as those by Kesten (1982) and Grimmett (1999), by providing a bridge between discrete models on lattices and continuous expansions in R n . In particular, our result strengthens the understanding of how percolation behaves in large-scale systems, a critical component for modeling real-world phenomena such as the spread of information in networks, the robustness of large infrastructures, or fluid flow in porous media.
Additionally, the uniqueness of the limiting percolation probability, independent of the specific sequence of balls chosen, reinforces the robustness of our approach, suggesting potential applications in more complex or generalized percolation models.

4. Conclusions

Our results highlight the importance of combining probabilistic and measure-theoretic techniques to rigorously study stochastic processes in infinite or expanding domains. Future work may explore similar frameworks in higher-dimensional percolation models or other stochastic processes where connectivity and large-scale behavior are of interest. Moreover, our methodology can serve as a foundation for further investigations into the interaction between discrete percolation models and continuous systems, potentially enriching both the theoretical and applied fields of statistical physics and probability theory.

Conflicts of Interest

The Author claims no conflicts of interest.

References

  1. Albert, R.; Barabási, A.-L. Statistical mechanics of complex networks. Reviews of Modern Physics 2002, 74, 47. [Google Scholar] [CrossRef]
  2. Billingsley, P. Probability and Measure, 3rd ed.; Wiley, 1995. [Google Scholar]
  3. Bollobás, B.; Riordan, O. Percolation; Cambridge University Press, 2006. [Google Scholar]
  4. Broadbent, S.R.; Hammersley, J.M. Percolation processes: I. Crystals and mazes. Mathematical Proceedings of the Cambridge Philosophical Society 1957, 53, 629–641. [Google Scholar] [CrossRef]
  5. Durrett, R. Probability: Theory and Examples, 4th ed.; Cambridge University Press, 2010. [Google Scholar]
  6. Grimmett, G. Percolation, 2nd ed; Springer, 1999. [Google Scholar]
  7. Kesten, H. Percolation Theory for Mathematicians; Birkhäuser, 1982. [Google Scholar]
  8. Newman, M.E.J. Networks: An Introduction; Oxford University Press, 2010. [Google Scholar]
  9. Royden, H.L.; Fitzpatrick, P. Real Analysis, 4th ed.; Pearson, 2010. [Google Scholar]
  10. Rudin, W. Real and Complex Analysis, 3rd ed.; McGraw-Hill, 1987. [Google Scholar]
  11. Stauffer, D.; Aharony, A. Introduction to Percolation Theory, 2nd ed.; Taylor & Francis, 1994. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated