2000 character limit reached
On a coalescence process and its branching genealogy
Published 22 Sep 2017 in math.PR and q-bio.PE | (1709.07633v1)
Abstract: We define and analyze a coalescent process as a recursive box-filling process whose genealogy is given by an ancestral time-reversed, time-inhomogeneous Bienyam\'{e}-Galton-Watson process. Special interest is on the expected size of a typical box and its probability of being empty. Special cases leading to exact asymptotic computations are investigated when the coalescing mechanisms are either linear-fractional or quadratic.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.