PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 1991The Annals of Probability850 citationsOpen Access

The Continuum Random Tree. I

DADavid Aldous

Key Points

Key points are not available for this paper at this time.

Abstract

Exact and asymptotic results for the uniform random labelled tree on n vertices have been studied extensively by combinatorialists. Here we treat asymptotics from a modern stochastic process viewpoint. There are three limit processes. One is an infinite discrete tree. The other two are most naturally represented as continuous two-dimensional fractal tree-like subsets of the infinite-dimensional space l₁. One is compact; the other is unbounded and self-similar. The proofs are based upon a simple algorithm for generating the finite random tree and upon weak convergence arguments. Distributional properties of these limit processes will be discussed in a sequel.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

David Aldous (1991) studied this question.

synapsesocial.com/papers/6a03795d3d6355fe2288c928https://doi.org/10.1214/aop/1176990534
Ask AI
Helpful
Bookmark
Share
View Full Paper