# Recurrence of Distributional Limits of Finite Planar Graphs

@article{Benjamini2000RecurrenceOD,
title={Recurrence of Distributional Limits of Finite Planar Graphs},
author={Itai Benjamini and Oded Schramm},
journal={Electronic Journal of Probability},
year={2000},
volume={6},
pages={1-13}
}
• Published 2000
• Mathematics, Physics
• Electronic Journal of Probability
Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the vertex degrees of the vertices in $G_j$ are bounded, and the bound does not depend on $j$. Then after passing to a subsequence, the limit exists, and is a random rooted graph $G$. We prove that with probability one $G$ is recurrent. The proof involves the Circle… Expand
376 Citations
The Local Limit of the Uniform Spanning Tree on Dense Graphs
• Mathematics, Physics
• 2017
Let G be a connected graph in which almost all vertices have linear degrees and let $$\mathcal {T}$$T be a uniform spanning tree of G. For any fixed rooted tree F of height r we compute theExpand
Recurrence of planar graph limits
• Mathematics
• 2012
We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infiniteExpand
On limits of sparse random graphs
• L. Vena
• Mathematics, Computer Science
• Electron. Notes Discret. Math.
• 2016
A notion of convergence for sequences of finite graphs { G n} that can be seen as a generalization of the Benjamini-Schramm convergence notion for bounded degree graphs and the left-convergence notion for dense graphs is presented. Expand
On the structure of random graphs with constant $r$-balls
• Mathematics
• 2018
We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$,Expand
Hyperfinite graph limits
G\'abor Elek introduced the notion of a hyperfinite graph family: a collection of graphs is hypefinite if for every $\epsilon>0$ there is some finite $k$ such that each graph $G$ in the collectionExpand
On the local geometry of graphs in terms of their spectra
• Mathematics, Computer Science
• Eur. J. Comb.
• 2019
It is proved that a sequence of graphs that share a common universal cover T and such that the proportion of eigenvalues of G n that lie within the support of the spectrum of T tends to 1 in the large n limit is asymptotically locally tree-like. Expand
Conformal growth rates and spectral geometry on distributional limits of graphs
For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the {\em conformal growth exponentExpand
Percolation on Hyperbolic Graphs
• Tom Hutchcroft
• Mathematics, Physics
• Geometric and Functional Analysis
• 2019
We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-knownExpand
Local limits of spatial inhomogeneous random graphs
• Mathematics
• 2021
Consider a set of n vertices, where each vertex has a location in R that is sampled uniformly from the unit cube in R, and a weight associated to it. Construct a random graph by placing edgesExpand
On large-girth regular graphs and random processes on trees
• Mathematics, Computer Science
• Random Struct. Algorithms
• 2018
Using Glauber dynamics on processes to give a sufficient condition for a branching Markov chain to be factor of i.i.d. processes, this work proves a family of combinatorial statements about random \$d-regular graphs. Expand