2000 character limit reached
Limits of Random Trees
Published 11 Jan 2014 in math.PR and math.CO | (1401.2521v1)
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 a random tree sequence where the probability of a given tree is proportional to $\prod_{v_i\in V(T)}d(v_i)!$. We show that this sequence is convergent and describe the limit object, which is a random infinite rooted tree.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.