Corpus ID: 4080865

Fragmentation process, pruning poset for rooted forests, and M̈obius inversion

  title={Fragmentation process, pruning poset for rooted forests, and M̈obius inversion},
  author={Ellen Baake and M. Esser},
  journal={arXiv: Probability},
  • Ellen Baake, M. Esser
  • Published 2017
  • Mathematics, Biology
  • arXiv: Probability
  • We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the genetic material of individuals in a population experiencing recombination. We aim at the law of the process over time. To this end, we investigate sets of realisations of this process that agree with respect to a specific order of events and represent each… CONTINUE READING
    1 Citations

    Figures from this paper.


    Single-crossover recombination and ancestral recombination trees
    • 11
    • PDF
    Partitioning, duality, and linkage disequilibria in the Moran model with recombination
    • 10
    • PDF
    Cutting down random trees
    • 77
    • PDF
    A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
    • 26
    • PDF
    Cutting down very simple trees
    • 56
    • PDF
    An exactly solved model for mutation, recombination and selection
    • 34
    • PDF
    A "Long Indel" model for evolutionary sequence alignment.
    • 141
    • PDF
    Random Trees: An Interplay between Combinatorics and Probability
    • 201
    Random cutting and records in deterministic and random trees
    • S. Janson
    • Computer Science
    • Random Struct. Algorithms
    • 2006
    • 38
    • PDF
    Single-crossover recombination in discrete time
    • 12
    • PDF