How probable is it to be first born? and other branching-process applications to kinship problems

DOI10.1016/0025-5564(82)90105-5zbMath0492.62094OpenAlexW2083493156MaRDI QIDQ1168036

Peter Jagers

Publication date: 1982

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(82)90105-5

zbMATH Keywords

birth ranksbirth-orderkinship problemsstable exponentially growing populations

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Exact distribution theory in statistics (62E15)

Related Items (5)

Branching processes. I ⋮ General branching processes in discrete time as random trees ⋮ On the convergence of supercritical general (C-M-J) branching processes ⋮ Line-of-descent and genealogical processes, and their applications in population genetics models ⋮ The stable doubly infinite pedigree process of supercritical branching populations

Cites Work

• On the convergence of supercritical general (C-M-J) branching processes
• Application of the Galton-Watson process to the kin number problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How probable is it to be first born? and other branching-process applications to kinship problems