Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · q-bio/0604009

Temporal and dimensional effects in evolutionary graph theory

C. J. Paley·S. N. Taraskin·S. R. Elliott
View original source ↗Read source document ↗Export metadata ↓

Abstract

The spread in time of a mutation through a population is studied analytically and computationally in fully-connected networks and on spatial lattices. The time, t_*, for a favourable mutation to dominate scales with population size N as N^{(D+1)/D} in D-dimensional hypercubic lattices and as N ln N in fully-connected graphs. It is shown that the surface of the interface between mutants and non-mutants is crucial in predicting the dynamics of the system. Network topology has a significant effect on the equilibrium fitness of a simple population model incorporating multiple mutations and sexual reproduction. Includes supplementary information.

Explore related subjects

q-bio.PE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

C. J. Paley, S. N. Taraskin, S. R. Elliott. 2007-02-27. Temporal and dimensional effects in evolutionary graph theory. https://doi.org/10.1103/physrevlett.98.098103

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Beta-coalescents when sample size is large

Sweepstakes reproduction refers to a highly skewed individual recruitment success without involving natural selection and may apply to individuals in broadcast spawning populations characterised by Type III survivorship. We consider an extension of the model of sweepstakes reproduction for a haploid panmictic population of constant size $N$; the extension also works as an alternative to the Wright-Fisher model. Our model incorporates an upper bound on the random number of potential offspring (juveniles) produced by a given individual. Depending on how the bound behaves relative to the total population size, we obtain the Kingman coalescent, an incomplete Beta-coalescent, or the (complete) Beta-coalescent. We argue that applying such an upper bound is biologically reasonable. Moreover, we estimate the error of the coalescent approximation. The error estimates reveal that convergence can be slow, and small sample size can be sufficient to invalidate convergence, for example if the stated bound is of the form $N/\log N$. We use simulations to investigate the effect of increasing sample size on the site-frequency spectrum. When the limit is a Beta-coalescent, the site frequency spectrum will be as predicted by the limiting tree even though the full coalescent tree may deviate from the limiting one. When in the domain of attraction of the Kingman coalescent the effect of increasing sample size depends on the effective population size as has been noted in the case of the Wright-Fisher model. Conditioning on the population ancestry (the random ancestral relations of the entire population at all times) may have little effect on the site-frequency spectrum for the models considered here (as evidenced by simulation results).

q-bio.PE↗
arXiv2026

The role of nestedness and saturating feedback in bipartite ecological systems

Large ecosystems balance competition and cooperation, yet standard generalized Lotka--Volterra models make mutualism destabilizing by amplifying disorder and driving unbounded growth. We show that Monod-like saturation resolves this paradox: dynamical mean-field theory and random-matrix analysis reveal a broader stable phase and enhanced survival. Network architecture provides a second control mechanism, but nestedness offers no intrinsic stability advantage. Instead, it is a byproduct of degree distributions with high connectivity necessary for stability.

q-bio.PE↗
arXiv2026

TreeFlow: probabilistic modelling and automatic differentiation for phylogenetics

Probabilistic modelling frameworks are powerful tools for statistical modelling and inference. They are not immediately generalizable to phylogenetic problems due to the particular computational properties of the phylogenetic tree object. TreeFlow is a software library for probabilistic modelling and automatic differentiation with phylogenetic trees. It embeds phylogenetic trees in the TensorFlow Probability framework, and implements inference algorithms for phylogenetic models given a fixed tree topology. We demonstrate how TreeFlow can be used to quickly implement and assess new models. We also show that it provides reasonable performance for gradient-based inference algorithms compared to specialized computational libraries for phylogenetics.

q-bio.PE↗