The split-and-drift random graph, a null model for speciation

DOI10.1016/J.SPA.2018.06.009MaRDI QIDQ2000138zbMATH OpenOpenAlexWikidataFDO

Authors François Bienvenu, Florence Débarre, Amaury Lambert

Publication date 28 June 2019

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.01015

zbMATH Keywords

coalescentgenetic driftdynamical networkspecies problemduplication-divergencevertex duplication

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Problems related to evolution (92D15) Random graphs (graph-theoretic aspects) (05C80) Population dynamics (general) (92D25) Discrete-time Markov processes on general state spaces (60J05) Exchangeability for stochastic processes (60G09)

Abstract: We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $1,ldots,n$. The dynamics of this Markov chain is governed by two types of events: vertex duplication, where at constant rate a pair of vertices is sampled uniformly and one of these vertices loses its incident edges and is rewired to the other vertex and its neighbors; and edge removal, where each edge disappears at constant rate. Besides the number of vertices $n$, the model has a single parameter $r_n$. Using a coalescent approach, we obtain explicit formulas for the first moments of several graph invariants such as the number of edges or the number of complete subgraphs of order $k$. These are then used to identify five non-trivial regimes depending on the asymptotics of the parameter $r_n$. We derive an explicit expression for the degree distribution, and show that under appropriate rescaling it converges to classical distributions when the number of vertices goes to infinity. Finally, we give asymptotic bounds for the number of connected components, and show that in the sparse regime the number of edges is Poissonian.

Recommendations

• A Markov chain approach to randomly grown graphs
• A time-invariant random graph with splitting events
• Further properties of a random graph with duplications and deletions
• Randomised reproducing graphs
• The probability of speciation on an interaction network with unequal substitution rates

Cites work

• scientific article; zbMATH DE number 3148873 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 3438144 (Why is no real title available?)
• A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
• Conceptual proofs of L L criteria for mean behavior of branching processes
• Fundamentals of Stein's method
• Growing conditioned trees
• Line-of-descent and genealogical processes, and their applications in population genetics models
• Poisson approximation for dependent trials
• Probabilistic models for the (sub)tree(s) of life
• Probability Models for DNA Sequence Evolution
• Probability. Theory and examples.
• Some mathematical models from population genetics. École d'Été de Probabilités de Saint-Flour XXXIX-2009
• The coalescent
• The species problem from the modeler's point of view

Cited in

(5)

• The partial duplication random graph with edge deletion
• The probability of speciation on an interaction network with unequal substitution rates
• A time-invariant random graph with splitting events
• Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022
• scientific article; zbMATH DE number 6941972 (Why is no real title available?)

This page was built for publication: The split-and-drift random graph, a null model for speciation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000138)