Takeover, fixation and identifiability in finite neutral genealogy models
From MaRDI portal
Publication:6504435
arXiv2104.00193MaRDI QIDQ6504435FDOQ6504435
Authors: Eric Foxall, Jen Labossiere 
Abstract: For neutral genealogy models in a finite, possibly non-constant population, there is a convenient representation of the family trees, known as the lookdown representation, that arranges descendant subtrees in size-biased order. We give a simple, conceptual demonstration of the size-biasing property, and address the problem of identifiability: under what conditions can we infer some or all of the lookdown arrangement by examining the (unlabelled) descendant subtrees? We explain how this question is connected to two important properties of the graph: uniqueness of the infinite path, and existence of a dominant lineage, and give sufficient and sometimes necessary conditions for each. We also discuss connections to the spinal representation of size-biased Galton-Watson trees.
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Genetics and population dynamics (92D99)
This page was built for publication: Takeover, fixation and identifiability in finite neutral genealogy models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6504435)
