Advertisement

Journal of Statistical Physics

, Volume 165, Issue 1, pp 153–163 | Cite as

The Mixing Time of a Random Walk on a Long-Range Percolation Cluster in Pre-Sierpinski Gasket

  • Jun Misumi
Article
  • 127 Downloads

Abstract

We consider a random graph created by the long-range percolation on the nth stage finite subset of a fractal lattice called the pre-Sierpinski gasket. The long-range percolation is a stochastic model in which any pair of two points is connected by a random bond independently. On the random graph obtained as above, we consider a discrete-time random walk. We show that the mixing time of the random walk is of order \(2^{(s-d)n}\) if \(d<s<2d\) in a sense. Here, s is a parameter which determines the order of probabilities that random bonds exist, and \(d=\log 3/\log 2\) is the Hausdorff dimension of the pre-Sierpinski gasket.

Keywords

Long-range percolation Mixing time Random walk Fractal lattice 

Notes

Acknowledgments

The author thanks to the referee for giving comments to the first version of the manuscript. The author was supported by JSPS KAKENHI Grant Number 16K17615.

References

  1. 1.
    Aldous, D., Fill, J.: Markov chains and random walks on graphs. Unfinished monograph. http://www.stat.berkeley.edu/~aldous (2002)
  2. 2.
    Benjamini, I., Berger, N., Yadin, A.: Long-range percolation mixing time. Comb. Probab. Comput. 17, 487–494 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Benjamini, I., Haber, S., Krivelevich, M., Lubetzky, E.: The isoperimetric constant of the random graph process. Random Struct. Algorithms 32, 101–114 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Benjamini, I., Berger, N., Yadin, A.: Long-range percolation mixing time (2009). arXiv:math/0703872v2
  5. 5.
    Berger, N.: Transience, recurrence and critical behavior for long-range percolation. Commun. Math. Phys. 226, 531–558 (2002)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Crawford, N., Sly, A.: Simple random walk on long range percolation clusters I: heat kernel bounds. Probab. Theory Relat. Fields 154, 753–786 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Crawford, N., Sly, A.: Simple random walk on long-range percolation clusters II: scaling limits. Ann. Probab. 41, 445–502 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1, 36–61 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kumagai, T., Misumi, J.: Heat kernel estimates for strongly recurrent random walk on random media. J. Theoret. Probab. 21, 910–935 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence, RI (2009)zbMATHGoogle Scholar
  11. 11.
    Misumi, J.: The diameter of a long-range percolation cluster on pre-Sierpinski gasket. J. Stat. Phys. 158, 1083–1089 (2015)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Peres, Y.: Mixing for Markov chains and spin systems. DRAFT Lecture notes for summer school at UBC on Mixing for Markov chains and spin systems. http://www.stat.berkeley.edu/~peres (2005)
  13. 13.
    Schulman, L.S.: Long range percolation in one dimension. J. Phys. A. Lett. 16, L639–L641 (1983)ADSMathSciNetGoogle Scholar
  14. 14.
    Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Comb. Probab. Comput. 1, 351–370 (1992)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Mathematics, Faculty of ScienceKochi UniversityAkebono-choJapan

Personalised recommendations