• Corpus ID: 12863130

The largest strongly connected component in Wakeley et al's cyclical pedigree model

  title={The largest strongly connected component in Wakeley et al's cyclical pedigree model},
  author={Jochen Blath and Stephan Kadow and Marcel Ortgiese},
  journal={arXiv: Probability},
We establish a link between Wakeley et al's (2012) cyclical pedigree model from population genetics and a randomized directed configuration model (DCM) considered by Cooper and Frieze (2004). We then exploit this link in combination with asymptotic results for the in-degree distribution of the corresponding DCM to compute the asymptotic size of the largest strongly connected component $S^N$ (where $N$ is the population size) of the DCM resp. the pedigree. The size of the giant component can be… 

Figures from this paper


Gene Genealogies Within a Fixed Pedigree, and the Robustness of Kingman’s Coalescent
It is shown that in many cases the (conceptually wrong) standard coalescent model is difficult to reject statistically and in this sense may provide a surprisingly accurate description of gene genealogies on a fixed pedigree.
Recent common ancestors of all present-day individuals
This work studies a two-parent analog of the Wright-Fisher model that defines ancestry using both parents, and finds that all partial ancestry of the current population ends, in the following sense: with high probability for large n, in each generation at least 1.77 lgn generations before the present.
Random Graphs and Complex Networks
  • R. Hofstad
  • Computer Science
    Cambridge Series in Statistical and Probabilistic Mathematics
  • 2016
This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.
Markov chains and mixing times
For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities.
Combinatorial Stochastic Processes
Preliminaries.- Bell polynomials, composite structures and Gibbs partitions.- Exchangeable random partitions.- Sequential constructions of random partitions.- Poisson constructions of random
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
The results follow a direct analogy of the extinction probabilities of classical branching processes on the strong connectivity for spaces of sparse random digraphs specified by degree sequence.
Combinatorial stochastic processes, volume 1875 of Lecture Notes in Mathematics
  • 2006