Skip to main content
Log in

Percolation with Constant Freezing

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

Abstract

We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate \(1\), and clusters freeze at rate \(\alpha \) independently of their size. Our main result is that the infinite volume process can be constructed on any amenable vertex transitive graph. This is in sharp contrast to models of percolation with freezing previously introduced, where the limit is known not to exist. Our interest is in the study of the percolative properties of the final configuration as a function of \(\alpha \). We also obtain more precise results in the case of trees. Surprisingly the algebraic exponent for the cluster size depends on the degree, suggesting that there is no lower critical dimension for the model. Moreover, even for \(\alpha <\alpha _c\), it is shown that finite clusters have algebraic tail decay, which is a signature of self organised criticality. Partial results are obtained on \(\mathbb {Z}^d\), and many open questions are discussed.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. Aldous, D.J.: The percolation process on a tree where infinite clusters are frozen. Math. Proc. Camb. Philos. Soc 128, 465–477 (1999)

    Article  MathSciNet  Google Scholar 

  2. Ben-Naim, E., Krapivsky, P.L.: Percolation with multiple giant clusters. J. Phys. A Math. Gen. 38, L417–L423 (2005)

    Article  MATH  MathSciNet  ADS  Google Scholar 

  3. Ben-Naim, E., Krapivsky, P.L.: Polymerization with freezing. J. Phys. Condens. Matter 17, S4249–S4262 (2005)

    Article  ADS  Google Scholar 

  4. Benjamini, I., Schramm, O.: Private communication to D. Aldous (1999)

  5. Burton, R.M., Keane, M.: Density and uniqueness in percolation. Commun. Math. Phys. 121(3), 501–505 (1989)

    Article  MATH  MathSciNet  ADS  Google Scholar 

  6. Campanino, M., Russo, L.: An upper bound on the critical percolation probability for the three- dimensional cubic lattice. Ann. Prob. 13(2), 478–491 (1985)

    Google Scholar 

  7. Drossel, B., Schwabl, F.: Self-organized critical forest-fire model. Phys. Rev. Lett. 69, 1629–1632 (1992)

    Article  ADS  Google Scholar 

  8. Durrett, R.: Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2007)

    Google Scholar 

  9. Gandolfi, A., Keane, M.S., Newman, C.M.: Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses. Probab. Theory Relat. Fields 92(4), 511–527 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Grimmett, G.: Percolation. Grundlehren der mathematischen Wissenschaften. Springer, Berlin (1999)

    Google Scholar 

  11. Grimmett, G.: Probability on Graphs: Random Processes on Graphs and Lattices. Institute of  Mathematical Statistics Textbooks, Cambridge University Press, Cambridge (2010)

  12. Hara, T., Slade, G.: Mean-field critical behaviour for percolation in high dimensions. Commun. Math. Phys. 128(2), 333–391 (1990)

    Article  MATH  MathSciNet  ADS  Google Scholar 

  13. Kallenberg, O.: Foundations of Modern Probability. Probability and its Applications, 2nd edn. Springer, New York (2002)

  14. Klarner, D.A.: Correspondences between plane trees and binary sequences. J. Comb. Theory 9(4), 401–411 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  15. Stahl, A.: Existence of a stationary distribution for multi-dimensional infinite volume forest-fire processes. ArXiv e-prints (2012)

  16. van den Berg, J., de Lima, B.N.B., Nolin, P.: A percolation process on the square lattice where large finite clusters are frozen. Random Struct. Algorithms 40(2), 220–226 (2012)

    Article  MATH  Google Scholar 

  17. van den Berg, J., Kiss, D., Nolin, P.: A percolation process on the binary tree where large finite clusters are frozen. Electron. Commun. Probab. 17, 1–11 (2012)

    MathSciNet  Google Scholar 

  18. van den Berg, J., Tóth, B.: A signal-recovery system: asymptotic properties, and construction of an infinite-volume limit (2000)

  19. Varadarajan, V.S.: Groups of automorphisms of borel spaces. Trans. Am. Math. Soc. 109(2), 191–220 (1963)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

I would like to thank Nathanaël Berestycki for suggesting this problem to me, for helpful discussion and for careful reading of various drafts of this paper. I am also grateful to Geoffrey Grimmett for suggesting I use ergodic decomposition in a similar way to [9]—see Lemma 2.15, and to the anonymous referee for their constructive comments. This work has been supported by the UK Engineering and Physical Sciences Research Council (EPSRC) Grant EP/H023348/1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Edward Mottram.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mottram, E. Percolation with Constant Freezing. J Stat Phys 155, 932–965 (2014). https://doi.org/10.1007/s10955-014-0985-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10955-014-0985-z

Keywords

Mathemathics Subject Classification

Navigation