Limits of Random Trees II

Abstract

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given degree distributions. Denote by ${\mathcal{D}}_n$ the set of possible degree sequences of a tree on $n$ nodes. Let ${\mathbf{D}}_n$ be a random variable on ${\mathcal{D}}_n$ and $\mathbf{T}({\mathbf{D}}_n)$ be a uniform random tree with degree sequence ${\mathbf{D}}_n$. We show that the sequence $\mathbf{T}({\mathbf{D}}_n)$ converges in probability if and only if ${\mathbf{D}}_n\to \mathbf{D}=(\mathbf{D}(i){)}_{i=1}^{\infty }$, where $\mathbf{D}(i)\sim \mathbf{D}(j)$, $\mathds{E}({\bm D}(1))=2$ and $\mathbf{D}(1)$ is a random variable on $\mathds{N}^+$.

14 pages

References in corpus (2)

• On limits of finite graphs
• Limits of Random Trees