×

On the limit of large girth graph sequences. (English) Zbl 1231.05259

Let \(d\geq2\) be given, and let \(\mu\) be an involution-invariant probability measure on the space of trees \(T\in {\mathcal T}_d\) with maximum degrees at most \(d\). Then \(\mu\) arises as the local limit of some sequence \(\{G_n\}_{n=1}^\infty\) of graphs with all degrees at most \(d\). This answers Question 3.3 of B. Bollobás and O. Riordan [“Sparse graphs: metrics and random models,” Random Struct. Algorithms 39, No.1, 1–38 (2011; Zbl 1223.05271)].

MSC:

05C99 Graph theory

Citations:

Zbl 1223.05271

References:

[1] D. Aldous and R. Lyons: Processes on Unimodular Random Networks, Electron. J. Probab. 12 (2007), Paper 54 (1454–1508). · Zbl 1131.60003 · doi:10.1214/EJP.v12-463
[2] 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. · Zbl 1037.60008
[3] I. Benjamini and O. Schramm: Recurrence of distributional limits of finite planar graphs, Electron. J. Probab. 6 (2001), Paper 23, 13 pp. (electronic). · Zbl 1010.82021
[4] B. Bollobás and O. Riordan: Sparse graphs: metrics and random models; Random Struct. Alg. (2010), http://dx.doi.org/10.1002/rsa.20334 . · Zbl 1223.05271
[5] L. Bowen: Periodicity and circle packings of the hyperbolic plane, Geom. Dedicata 102 (2003), 213–236. · Zbl 1074.52007 · doi:10.1023/B:GEOM.0000006580.47816.e9
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.