Abstract
On a certain class of general discrete spaces including fractals, we consider a model in which each pair of distinct points is connected by a random bond. The main question we are concerned is whether a connected component consisting of infinitely many points exists or not. This depends on the choice of parameters in the connecting probabilities, and the aim of this paper is to find thresholds of the parameters
Similar content being viewed by others
References
M. Aizenman and C.M. Newman, Discontinuity of the percolation density in one dimensional 1/|x-y|2 Percolation Models. Commun. Math. Phys. 107: 611–647 (1986).
P. Antal and A. Pisztora, On the chemical distance for supercritical Bernoulli percolation. Ann. Probab. 24: 1036–1048 (1996).
N. Berger, Transience, recurrence and critical behavior for long-range percolation. Commun. Math. Phys. 226: 531–558 (2002).
N. Berger, A lower bound for the chemical distance in sparse long-range percolation models. Preprint (2004).
I. Benjamini and N. Berger, The diameter of long-range percolation clusters on finite cycles. Random Struct. Algorithms 19(2):102–111 (2001).
I. Benjamini, H. Kesten, Y. Peres and O. Schramm, Geometry of the uniform spanning forest: Transitions in dimensions 4, 8, 12,⋯. Ann. Math. 160: 465–491 (2004).
M. Biskup, Graph diameter in long-range percolation. Preprint (2004).
M. Biskup, On the scaling of the chemical distance in long-range percolation models. Ann. Probab. 32: 2938–2977 (2004).
B. Bollobas, S. Janson and O. Riordan, Long-range percolation in R d. Preprint (2005).
D. Coppersmith, D. Gamarnik and M. Sviridenko, The diameter of a one-dimensional long-range percolation graph. Random Struct. Algorithms 21: 1–13 (2002).
G. R. Grimmett, Percolation, 2nd edn. (Springer, 1999).
G. R. Grimmett, M. Keane and J. M. Marstrand. On the connectedness of a random graph. Math. Proc. Camb. Philos. Soc. 96: 151–166 (1984).
S. Kalikow and B. Weiss, When are random graphs connected? Israel J. Math. 62: 257–268 (1988).
H. Kesten, Correlation length and critical probabilities of slabs for percolation. Unpublished manuscript (1988).
T. Kumagai, Percolation on Pre-Sierpinski carpets. New Trend in Stochastic Analysis. Proceedings of a Taniguchi International Workshop, K. D. Elworthy et al., eds. (World Scientific, 1997), pp. 288–304.
C. M. Newman and L. S. Schulman, One dimensional 1/|j-i|s percolation models: the existence of a transition for s≤ 2. Commun. Math. Phys. 104: 547–571 (1986).
L. S. Schulman, Long range percolation in one dimension. J. Phys. A. Lett. 16: L639–L641 (1983).
M. Shinoda, Existence of phase transition of percolation on Sierpinski carpet lattices. J. Appl. Prob. 39: 1–10 (2002).
M. Shinoda, Non-existence of phase transition of oriented percolation on Sierpinski carpet lattices. Prob. Theory Relat. Fields. 125: 447–456 (2003).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Misumi, J. Critical Values in a Long-range Percolationon Spaces Like Fractals. J Stat Phys 125, 873–883 (2006). https://doi.org/10.1007/s10955-006-9243-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-006-9243-3