Percolation on Graphs
Part of the Lecture Notes in Mathematics book series (LNM, volume 2100)
In this section we introduce and discuss some basic properties of percolation, a fundamental random process on graphs. For background on percolation see [Gri99].
KeywordsCayley 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.
- [BDCGS12]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–476Google Scholar
- [CFKP97]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–115Google Scholar
- [GL13]G. Grimmett, Z. Li, Counting self-avoiding walks. arXiv:1304.7216 (2013)Google Scholar
- [Gri99]G. Grimmett, Percolation. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 321, 2nd edn. (Springer, Berlin, 1999)Google Scholar
- [LL10]G.F. Lawler, V. Limic, Random walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics, vol. 123 (Cambridge University Press, Cambridge, 2010)Google Scholar
- [MS93]N. Madras, G. Slade, The Self-Avoiding Walk. Probability and its Applications (Birkhäuser, Boston, 1993)Google Scholar
- [Per99]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–280Google Scholar
© Springer International Publishing Switzerland 2013