A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
The Continuum Random Tree III
1993
Annals of Probability
Let (W(k), k 2 1) be random trees with k leaves, satisfying a consistency condition: Removing a random leaf from R(k) gives R(k -1). Then under an extra condition, this family determines a random continuum tree ?/, which it is convenient to represent as a random subset of 11. This leads to an abstract notion of convergence in distribution, as n -A o, of (rescaled) random trees En-on n vertices to a limit continuum random tree I/. The notion is based upon the assumption that, for fixed k, the
doi:10.1214/aop/1176989404
fatcat:4oyqnmkw5nfbvivyfuipdchaie