Advertisement

Journal of Statistical Physics

, Volume 174, Issue 2, pp 276–286 | Cite as

The Diameter of a Long-Range Percolation Cluster on Generalized Pre-Sierpinski Carpet and Regular Tree

  • Jun MisumiEmail author
Article
  • 39 Downloads

Abstract

We consider some kinds of graphs obtained by generalizing the pre-Sierpinski carpet, which is one of well known fractal lattices. Here, we deal with not only some fractal lattices, but also many irregular graphs which do not belong to fractal lattices. Under several assumptions, we present estimates on a diameter of the long-range percolation cluster on such graphs. In Misumi (J Stat Phys 158:1083–1089, 2015), estimates on the graph diameter of the long-range percolation cluster are established on the pre-Sierpinski gasket, which is another fundamental fractal lattice, and the result of this paper is its extension in a certain sense. We will also discuss the behavior of the diameter of the long-range percolation graph on a regular tree, which seems to be quite different from the result on the generalized pre-Sierpinski carpet.

Keywords

Long-range percolation Graph diameter Generalized pre-Sierpinski carpet Fractal lattice Regular tree 

Notes

Acknowledgements

The author thanks to the referees for reading the manuscript carefully and giving valuable comments. The author was supported by JSPS KAKENHI Grant Number 16K17615.

References

  1. 1.
    Benjamini, I., Berger, N.: The diameter of long-range percolation clusters on finite cycles. Random Struct. Algorithms 19, 102–111 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Berger, N.: A lower bound for the chemical distance in sparse long-range percolation models. arXiv:math/0409021 (2004)
  4. 4.
    Biskup, M.: On the scaling of the chemical distance in long-range percolation models. Ann. Probab. 32, 2938–2977 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Biskup, M.: Graph diameter in long-range percolation. Random Struct. Algorithms 39, 210–227 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Biskup, M., Lin, J.: Sharp asymptotic for the chemical distance in long-range percolation. arXiv:1705.10380 (2017)
  7. 7.
    Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Struct. Algorithms 21, 1–13 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Deijfen, M., van der Hofstad, R., Hooghiemstra, G.: Scale-free percolation. Ann. Inst. Henri Poincaré Probab. Stat. 49, 817–838 (2013)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Deprez, P., Hazra, R.S., Wüthrich, M.V.: Inhomogeneous long-range percolation for real-life network modeling. Risks 3, 1–23 (2015)CrossRefGoogle Scholar
  10. 10.
    Ding, J., Sly, A.: Distances in critical long range percolation. arXiv:1303.3995 (2015)
  11. 11.
    Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications, 3rd edn. John Wiley and Sons Ltd, Chichester (2014)zbMATHGoogle Scholar
  12. 12.
    Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley, New York (2000)CrossRefzbMATHGoogle Scholar
  13. 13.
    Misumi, J.: The diameter of a long-range percolation cluster on pre-Sierpinski gasket. J. Stat. Phys. 158, 1083–1089 (2015)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Misumi, J.: The mixing time of a random walk on a long-range percolation cluster in pre-Sierpinski gasket. J. Stat. Phys. 165, 153–163 (2016)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Schulman, L.S.: Long range percolation in one dimension. J. Phys. A. Lett. 16, L639–L641 (1983)ADSMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Mathematics, Faculty of Science and TechnologyKochi UniversityAkebono-choJapan

Personalised recommendations