A family of random trees with random edge lengths
From MaRDI portal
Publication:4265788
DOI10.1002/(SICI)1098-2418(199909)15:2%3C176::AID-RSA4%3E3.0.CO;2-4zbMATH Open0934.05117OpenAlexW2018043625MaRDI QIDQ4265788FDOQ4265788
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
Recommendations
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex degrees (05C07) Enumeration in graph theory (05C30)
Cites Work
- Exchangeable and partially exchangeable random partitions
- Steiner Minimal Trees
- Title not available (Why is that?)
- The continuum random tree. III
- 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
- On weighted heights of random trees
Cited In (11)
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Inverting the cut-tree transform
- Stable trees as mixings of inhomogeneous continuum random trees
- Binary trees with choosable edge lengths
- A distributional study of the path edge-covering numbers for random trees
- Limit of normalized quadrangulations: the Brownian map
- On a coloured tree with non i.i.d. random labels
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
- Scaling limits for some random trees constructed inhomogeneously
- A representation of exchangeable hierarchies by sampling from random real trees
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
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)
