ArticleCommunications biology2019
Exploring and mapping the universe of evolutionary graphs identifies structural properties affecting fixation probability and time.
Article in Communications biology, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 27 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
27 citing papers in PubMed.
- Article
- Mixed updating in structured populations.PLoS computational biology · 2026Article
- Environment heterogeneity creates fast amplifiers of natural selection in graph-structured populations.Nature communications · 2026Article
- Colonization times in Moran process on graphs.PLoS computational biology · 2025Article
- The effects of herding and dispersal behaviour on the evolution of cooperation on complete networks.Journal of mathematical biology · 2024Article
- Fixation times on directed graphs.PLoS computational biology · 2024Article
- Evolutionary graph theory beyond single mutation dynamics: on how network-structured populations cross fitness landscapes.Genetics · 2024Article
- The speed of neutral evolution on graphs.Journal of the Royal Society, Interface · 2024Article
- A theory of evolutionary dynamics on any complex population structure reveals stem cell niche architecture as a spatial suppressor of selection.Nature communications · 2024Article
- Evolutionary graph theory beyond pairwise interactions: Higher-order network motifs shape times to fixation in structured populations.PLoS computational biology · 2024Article
- Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating.PLoS computational biology · 2024Article
- Evolutionary dynamics of mutants that modify population structure.Journal of the Royal Society, Interface · 2023Article
- Frequent asymmetric migrations suppress natural selection in spatially structured populations.PNAS nexus · 2023Article
- Symmetry in models of natural selection.Journal of the Royal Society, Interface · 2023Article
- Mutant fixation in the presence of a natural enemy.Nature communications · 2023Article
- Self-loops in evolutionary graph theory: Friends or foes?PLoS computational biology · 2023Article
- Fixation dynamics on hypergraphs.PLoS computational biology · 2023Article
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-Birth updating.Journal of mathematical biology · 2023Article
- Suppressors of fixation can increase average fitness beyond amplifiers of selection.Proceedings of the National Academy of Sciences of the United States of America · 2022Article
- Evolution of cooperation with asymmetric social interactions.Proceedings of the National Academy of Sciences of the United States of America · 2022Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Population structure can be modeled by evolutionary graphs, which can have a substantial influence on the fate of mutants. Individuals are located on the nodes of these graphs, competing to take over the graph via the links. Applications for this framework range from the ecology of river systems and cancer initiation in colonic crypts to biotechnological search for optimal mutations. In all these applications, both the probability of fixation and the associated time are of interest. We study this problem for all undirected and unweighted graphs up to a certain size. We devise a genetic algorithm to find graphs with high or low fixation probability and short or long fixation time and study their structure searching for common themes. Our work unravels structural properties that maximize or minimize fixation probability and time, which allows us to contribute to a first map of the universe of evolutionary graphs.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.