Abstract
Let d≥2 be given and let µ be an involution-invariant probability measure on the space of trees T ∈ T d with maximum degrees at most d. Then µ arises as the local limit of some sequence {G n } ∞n=1 of graphs with all degrees at most d. This answers Question 3.3 of Bollobás and Riordan [4].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Aldous and R. Lyons: Processes on Unimodular Random Networks, Electron. J. Probab.12 (2007), Paper 54 (1454–1508).
D. Aldous and M. J. Steele: The objective method: probabilistic combinatorial optimization and local weak convergence; in: Probability on discrete structures, pp. 1–72, Encyclopaedia Math. Sci., 110, Springer, Berlin, 2004.
I. Benjamini and O. Schramm: Recurrence of distributional limits of finite planar graphs, Electron. J. Probab.6 (2001), Paper 23, 13 pp. (electronic).
B. Bollobás and O. Riordan: Sparse graphs: metrics and random models; Random Struct. Alg. (2010), http://dx.doi.org/10.1002/rsa.20334.
L. Bowen: Periodicity and circle packings of the hyperbolic plane, Geom. Dedicata102 (2003), 213–236.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Elek, G. On the limit of large girth graph sequences. Combinatorica 30, 553–563 (2010). https://doi.org/10.1007/s00493-010-2559-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-010-2559-2