A family of random trees with random edge lengths

DOI10.1002/(SICI)1098-2418(199909)15:2%3C176::AID-RSA4%3E3.0.CO;2-4MaRDI QIDQ4265788zbMATH OpenOpenAlexFDO

Authors David Aldous, Jim Pitman

Publication date 10 April 2000

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199909)15:2%3C176::aid-rsa4%3E3.0.co;2-4

zbMATH Keywords

degree sequencerandom trees with edge lengths

Mathematics Subject Classification ID

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

Recommendations

• Limit theorems for random trees.
• On the total heights of random rooted trees
• A distributional study of the path edge-covering numbers for random trees
• scientific article; zbMATH DE number 125478

Cites work

• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• Coalescent random forests
• Exchangeable and partially exchangeable random partitions
• Line-of-descent and genealogical processes, and their applications in population genetics models
• On weighted heights of random trees
• Partition structures derived from Brownian motion and stable subordinators
• Steiner Minimal Trees
• The continuum random tree. III
• The standard additive coalescent

Cited in

(13)

• Limit of normalized quadrangulations: the Brownian map
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Consistent Markov branching trees with discrete edge lengths
• Universality for critical heavy-tailed network models: metric structure of maximal components
• A representation of exchangeable hierarchies by sampling from random real trees
• Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
• Inverting the cut-tree transform
• Scaling limits for some random trees constructed inhomogeneously
• A distributional study of the path edge-covering numbers for random trees
• Stable trees as mixings of inhomogeneous continuum random trees
• On a coloured tree with non i.i.d. random labels
• Binary trees with choosable edge lengths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265788)