A family of random trees with random edge lengths
From MaRDI portal
DOI<176::AID-RSA4>3.0.CO;2-4 10.1002/(SICI)1098-2418(199909)15:2<176::AID-RSA4>3.0.CO;2-4zbMath0934.05117MaRDI QIDQ4265788
David J. Aldous, Jim W. Pitman
Publication date: 10 April 2000
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199909)15:2<176::aid-rsa4>3.0.co;2-4
05C05: Trees
05C80: Random graphs (graph-theoretic aspects)
05C30: Enumeration in graph theory
60C05: Combinatorial probability
05C07: Vertex degrees
Related Items
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Limit of normalized quadrangulations: the Brownian map, Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions, A representation of exchangeable hierarchies by sampling from random real trees, Scaling limits for some random trees constructed inhomogeneously, Universality for critical heavy-tailed network models: metric structure of maximal components, Inverting the cut-tree transform
Cites Work
- Unnamed Item
- Line-of-descent and genealogical processes, and their applications in population genetics models
- Coalescent random forests
- The standard additive coalescent
- Partition structures derived from Brownian motion and stable subordinators
- Exchangeable and partially exchangeable random partitions
- The continuum random tree. III
- On weighted heights of random trees
- Steiner Minimal Trees