A family of random trees with random edge lengths

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.05117OpenAlexW2018043625MaRDI 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

zbMATH Keywords

degree sequencerandom trees with edge lengths

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Vertex degrees (05C07)

Related Items (7)

A representation of exchangeable hierarchies by sampling from random real trees ⋮ Limit of normalized quadrangulations: the Brownian map ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Scaling limits for some random trees constructed inhomogeneously ⋮ Inverting the cut-tree transform ⋮ Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions

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

This page was built for publication: A family of random trees with random edge lengths