On the limit of large girth graph sequences (Q653833): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 0811.1149 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Processes on unimodular random networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4450065 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recurrence of distributional limits of finite planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse graphs: Metrics and random models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Periodicity and circle packings of the hyperbolic plane / rank | |||
Normal rank |
Revision as of 18:08, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the limit of large girth graph sequences |
scientific article |
Statements
On the limit of large girth graph sequences (English)
0 references
19 December 2011
0 references
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 \textit{B. Bollobás} and \textit{O. Riordan} [``Sparse graphs: metrics and random models,'' Random Struct. Algorithms 39, No.\,1, 1--38 (2011; Zbl 1223.05271)].
0 references
involution invariant probability measure
0 references
limit of sequence of trees
0 references