Skip to main content

Percolation on Graphs

  • 1594 Accesses

Part of the Lecture Notes in Mathematics book series (LNMECOLE,volume 2100)

Abstract

In this section we introduce and discuss some basic properties of percolation, a fundamental random process on graphs. For background on percolation see [Gri99].

Keywords

  • Cayley Graph
  • Percolation Process
  • Open Component
  • Open Edge
  • Graph Covering

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. R. Bauerschmidt, H. Duminil-Copin, J. Goodman, G. Slade, Lectures on self-avoiding walks. in Probability and Statistical Physics in Two and More Dimensions, Clay Mathematics Institute Proceedings, vol. 15, ed. by D. Ellwood, C.M. Newman, V. Sidoravicius, W. Werner (Cambridge, MA, 2012), pp. 395–476

    Google Scholar 

  2. I. Benjamini, R. Pemantle, Y. Peres, Unpredictable paths and percolation. Ann. Probab. 26(3), 1198–1211 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. J.W. Cannon, W.J. Floyd, R. Kenyon, W.R. Parry, Hyperbolic geometry, in Flavors of Geometry. Mathematical Sciences Research Institute Publications, vol. 31 (Cambridge University Press, Cambridge, 1997), pp. 59–115

    Google Scholar 

  4. G. Grimmett, Z. Li, Counting self-avoiding walks. arXiv:1304.7216 (2013)

    Google Scholar 

  5. G. Grimmett, Percolation. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 321, 2nd edn. (Springer, Berlin, 1999)

    Google Scholar 

  6. G.F. Lawler, V. Limic, Random walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics, vol. 123 (Cambridge University Press, Cambridge, 2010)

    Google Scholar 

  7. T.M. Liggett, R.H. Schonmann, A.M. Stacey, Domination by product measures. Ann. Probab. 25(1), 71–95 (1997)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. N. Madras, G. Slade, The Self-Avoiding Walk. Probability and its Applications (Birkhäuser, Boston, 1993)

    Google Scholar 

  9. Y. Peres, Probability on trees: an introductory climb, in Lectures on Probability Theory and Statistics, Saint-Flour, 1997. Lecture Notes in Mathematics, vol. 1717 (Springer, Berlin, 1999), pp. 193–280

    Google Scholar 

  10. R. Paley, A. Zygmund, A note on analytic functions in the unit circle. Math. Proc. Cambridge Math. Soc. 28(03), 266–272 (1932)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Benjamini, I. (2013). Percolation on Graphs. In: Coarse Geometry and Randomness. Lecture Notes in Mathematics(), vol 2100. Springer, Cham. https://doi.org/10.1007/978-3-319-02576-6_4

Download citation