Code and supplementary information for the speed of neutral evolution on graphs
Data files
Apr 01, 2024 version files 20.15 MB
-
all_state_112_graph.zip
-
Data_and_code_for_speed_of_netural_evolution_on_grpahs.zip
-
README.md
Abstract
The speed of evolution on structured populations is crucial for biological and social systems. The likelihood of invasion is key for evolutionary stability, but it makes little sense if it takes long. It is far from known what population structure slows down evolution. We investigate the absorption time of a single neutral mutant for all the 112 non-isomorphic undirected graphs of size 6. We find that about three-quarters of the graphs have an absorption time close to that of the complete graph, less than one-third are accelerators, and more than two-thirds are decelerators. Surprisingly, determining whether a graph has a long absorption time is too complicated to be captured by the joint degree distribution. Via the largest sojourn time, we find that echo-chamber-like graphs, which consist of two homogeneous graphs connected by few sparse links, are likely to slow down absorption. These results are robust for large graphs, mutation patterns as well as evolutionary processes. This work serves as a benchmark for timing evolution with complex interactions and fosters the understanding of polarization in opinion formation.
README: Code and supplementary information for the speed of neutral evolution on graphs
https://doi.org/10.5061/dryad.0p2ngf27x
Description of the data and code
- Data
1. graphs.RData:
This file contains the adjacency matrices of 112 undirected graphs with 6 nodes. These adjacency matrices represent the connectivity patterns of the graphs and can be utilized for generating an Atlas of all the undirected graphs of size 6. For generating Atlases of graphs with larger node sizes, please refer to NetworkX or other graph analysis libraries.
2. all_state_112_graph.zip
The file contains visual representations of the 64 states for each of the 112 graphs. These states comprise 2 absorbing states and 62 transient states.
* code
1. DB_six_nodes_random_initial.R:
This script file is designed to compute simulation results for Death-Birth process under neutral selection for each graph included in the graphs.RData file. Specifically, it calculates the fixation probability, fixation time, extinction time, and absorption time under uniform initialization.
2. DB_six_nodes_temp.R:
This script file is intended to compute simulation results for Death-Birth process under neutral selection for each graph included in the graphs.RData file. It calculates the fixation probability, fixation time, extinction time, and absorption time under temperature-dependent mutation.
3. BD_six_nodes_random_initial.R:
This script file is designed to compute simulation results for Birth-Death process under neutral selection for each graph included in the graphs.RData file. Specifically, it calculates the fixation probability, fixation time, extinction time, and absorption time under uniform initialization.
##