The largest strongly connected component in the cyclical pedigree model of Wakeley et al.
DOI10.1016/j.tpb.2014.10.001zbMath1304.92105arXiv1405.7276OpenAlexW1974820400WikidataQ51002925 ScholiaQ51002925MaRDI QIDQ2514395
Marcel Ortgiese, Stephan Kadow, Jochen Blath
Publication date: 3 February 2015
Published in: Theoretical Population Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.7276
random digraphdirected configuration modelgiant componentcoalescence in a fixed pedigreediploid monoecious Wright-Fisher modelWakeley et al.'s cyclical model
Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10)
Related Items (1)
Cites Work
- Stationary distribution and cover time of random walks on random digraphs
- To what extent does genealogical ancestry imply genetic ancestry?
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The coalescent
- Negative association of random variables, with applications
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Coalescent results for two-sex population models
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
- Recent common ancestors of all present-day individuals
- Unnamed Item
- Unnamed Item
This page was built for publication: The largest strongly connected component in the cyclical pedigree model of Wakeley et al.