Limits of random trees. II (Q2341945): Difference between revisions

This paper builds on an earlier paper of the author [Acta Math. Hung. 145, No. 1, 205--219 (2015; Zbl 1363.05239)] about limit objects of sequences of graphs, a current topic of research and one increasingly involved with the (harder) case of sparse graphs where the issues are harder. That earlier paper described the limit object of the sequence of graphs when the graphs are trees coming from a given degree distribution. In this paper the author extends his result by showing that if \({\mathcal D}_{n}\) is the set of possible degree distributions of a labelled tree on \(n\) vertices, then letting \({\mathbf D}_{n}\) be a random variable on \({\mathcal D}_{n}\) and \({\mathbf T}({\mathbf D}_{n})\) be a uniform random labelled tree with degree sequence \({\mathbf D}_{n}\), then the sequence \({\mathbf T}({\mathbf D}_{n})\) converges to a limit if and only if \({\mathbf D}_{n}\) converges to \({\mathbf D}=({\mathbf D}(i))_{i=1}^{\infty}\) where the \({\mathbf D}(i)\) are identically distributed and \(\mathbb{E}({\mathbf D}(1))=2\) and \({\mathbf D}(1)\) takes values in the positive integers. This result in in some sense a generalisation of a result from \textit{S. Chatterjee} et al. \textit{A. Sly} [Ann. Appl. Probab. 21, No. 4, 1400--1435 (2011; Zbl 1234.05206)]. The techniques include defining, and working with, a notion of convergence of a sequence of degree sequences, and dealing with labelled homomorphisms.