Skip to main content
Log in

The Diameter of a Long-Range Percolation Cluster on Pre-Sierpinski Gasket

  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

Abstract

We give several bounds for a graph diameter of a random graph created by a stochastic model called the long-range percolation, in which any pair of two distinct points is connected by a random bond independently. Such a problem is well studied on a finite subset of the \(d\)-dimensional square lattice, where \(d\) is a positive integer. In this manuscript, we consider the problem on a finite subset of a fractal lattice which is called the pre-Sierpinski gasket. We can observe that the Hausdorff dimension of the fractal lattice appears in the critical parameters of \(s\), where \(s\) is a value determining the order of probabilities that random bonds exist.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Benjamini, I., Berger, N.: The diameter of long-range percolation clusters on finite cycles. Random Struct. Algorithms. 19, 102–111 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Benjamini, I., Kesten, H., Peres, Y., Schramm, O.: Geometry of the uniform spanning forest: transitions in dimensions \(4,8,12,\cdots \). Ann. Math. 160, 465–491 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benjamini, I., Berger, N., Yadin, A.: Long-range percolation mixing time. Comb. Probab. Comput. 17, 487–494 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Biskup, M.: On the scaling of the chemical distance in long-range percolation models. Ann. Probab. 32, 2938–2977 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Biskup, M.: Graph diameter in long-range percolation. Random Struct. Algorithms. 39, 210–227 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Struct. Algorithms. 21, 1–13 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Crawford, N., Sly, A.: Simple random walk on long range percolation clusters I: heat kernel bounds. Probab. Theory Relat. Fields. 154, 753–786 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Crawford, N., Sly, A.: Simple random walk on long-range percolation clusters II: scaling limits. Ann. Probab. 41, 445–502 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley, New York (2000)

    Book  MATH  Google Scholar 

  10. Misumi, J.: Critical values in a long-range percolation on spaces like fractals. J. Stat. Phys. 125, 877–887 (2006)

    Article  ADS  MathSciNet  Google Scholar 

  11. Schulman, L.S.: Long range percolation in one dimension. J. Phys. A. Lett. 16, L639–L641 (1983)

    ADS  MathSciNet  Google Scholar 

Download references

Acknowledgments

The author thanks to the referee for reading the manuscript carefully and giving kind comments for improvements.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Misumi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Misumi, J. The Diameter of a Long-Range Percolation Cluster on Pre-Sierpinski Gasket. J Stat Phys 158, 1083–1089 (2015). https://doi.org/10.1007/s10955-014-1170-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10955-014-1170-0

Keywords

Navigation