Horton self-similarity of Kingman's coalescent tree
classification
🧮 math.PR
math-phmath.CAmath.COmath.MP
keywords
treekingmanhortonself-similaritycoalescentcombinatorialprocessbranches
read the original abstract
The paper establishes a weak version of Horton self-similarity for a tree representation of Kingman's coalescent process. The proof is based on a Smoluchowski-type system of ordinary differential equations for the number of branches of a given Horton-Strahler order in a tree that represents Kingman's N-coalescent process with a constant kernel, in a hydrodynamic limit. We also demonstrate a close connection between the combinatorial Kingman's tree and the combinatorial level set tree of a white noise, which implies Horton self-similarity for the latter.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.