Coalescent random forests (Q1284161)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1271728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coalescent random forests |
scientific article; zbMATH DE number 1271728 |
Statements
Coalescent random forests (English)
0 references
30 March 1999
0 references
Suppose that rooted forests (in which the edges in each tree are directed away from the root of the tree) are formed by starting with a set of \(n\) labelled vertices and succesively adding an edge \(uv\) from a randomly chosen vertex \(u\) to the root \(v\) of a randomly chosen tree not containing \(u\). The author derives several enumeration formulae for forests and trees by means of such a coalescent construction; and he relates such a construction to models of clustering or coagulation processes with applications in various areas, among other things.
0 references
forests
0 references
tree
0 references
enumeration
0 references
clustering or coagulation processes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8635655
0 references
