Abstract
In this section we will only consider connected simple graphs (i.e. without loops or multiple edges). We start by recalling few definitions from previous sections. If G = (V, E) is such a graph, and x, y ∈ V, the graph distance between x and y in G is defined to be the length of a shortest path in G between x and y, and is denoted by d G (x, y). A rooted graph (G, ρ) is a graph G together with a distinguished vertex ρ of G.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N. Alon, I. Benjamini, A. Stacey, Percolation on finite graphs and isoperimetric inequalities. Ann. Probab. 32(3A), 1727–1745 (2004)
D. Aldous, R. Lyons, Processes on unimodular random networks. Electron. J. Probab. 12(54), 1454–1508 (2007)
I. Benjamini, N. Curien, Ergodic theory on stationary random graphs. Electron. J. Probab. 17(93), 20 (2012)
I. Benjamini, R. Lyons, Y. Peres, O. Schramm, Group-invariant percolation on graphs. Geom. Funct. Anal. 9(1), 29–66 (1999)
I. Benjamini, A. Nachmias, Y. Peres, Is the critical percolation probability local? Probab. Theory Relat. Fields 149(1–2), 261–269 (2011)
I. Benjamini, O. Schramm, Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6(23), 13 pp. (2001) (electronic)
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
G. Grimmett, Percolation. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 321, 2nd edn. (Springer, Berlin, 1999)
O. Häggström, Two badly behaved percolation processes on a nonunimodular graph. J. Theor. Probab. 24, 1–16 (2011)
T. Hara, G. Slade, Mean-field critical behaviour for percolation in high dimensions. Commun. Math. Phys. 128(2), 333–391 (1990)
R. Lyons, R. Pemantle, Y. Peres, Ergodic theory on Galton-Watson trees: speed of random walk and dimension of harmonic measure. Ergodic Theory Dyn. Syst. 15(3), 593–619 (1995)
R. Lyons, O. Schramm, Indistinguishability of percolation clusters. Ann. Probab. 27(4), 1809–1836 (1999)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Benjamini, I. (2013). Local Limits of Graphs. In: Coarse Geometry and Randomness. Lecture Notes in Mathematics(), vol 2100. Springer, Cham. https://doi.org/10.1007/978-3-319-02576-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-02576-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02575-9
Online ISBN: 978-3-319-02576-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)