Data of "An accurate database of the fixation probabilities for all undirected graphs of order 10 or less"

Fernando Alcalde Cuesta,
Fernando Alcalde CuestaUniversidade de Santiago de Compostela

Pablo González Sequeiros,
Pablo González SequeirosUniversidade de Santiago de Compostela

Álvaro Lozano Rojo,

Rubén Vigara Benito
Rubén Vigara BenitoCentro Universitario de la Defensa Zaragoza
Description of this data
The fixation probability is a fundamental concept in evolutionary dynamics, representing the probability that a gene spreads over a whole population. An interesting model to study both neutral drift and natural selection on homogeneous population was introduced by Moran in the '50, and later generalized to non uniform populations by Lieberman et al in 2005.
Here we present an accurate database of the fixation probabilities for all undirected graphs with 10 or less vertices. Moreover, the database has been enriched with some graph invariants which have been related to the fixation probability.
The fixation probabilities are computed with extreme accuracy with a relative error similar to the machine error.
Using python and the h5py package it can be easily explored. The following lines describes how to read this data and plot a simple scatter of the probability of fixation at r=2 vs biconnectivity:
import h5py as h5
import matplotlib.pyplot as plt
infile = h5.File('fp_le10.hdf5', 'r')
data = infile['FP'][:]
infile.close()
plt.plot( data['FP_2.0'], data['is_biconnected'], 'o' )
plt.show()
Experiment data files

The fixation probabilities of all undirected graphs with 10 or less vertices + some statistics and measures of the graphs
Related links
Description of this data
The fixation probability is a fundamental concept in evolutionary dynamics, representing the probability that a gene spreads over a whole population. An interesting model to study both neutral drift and natural selection on homogeneous population was introduced by Moran in the '50, and later generalized to non uniform populations by Lieberman et al in 2005.
Here we present an accurate database of the fixation probabilities for all undirected graphs with 10 or less vertices. Moreover, the database has been enriched with some graph invariants which have been related to the fixation probability.
The fixation probabilities are computed with extreme accuracy with a relative error similar to the machine error.
Using python and the h5py package it can be easily explored. The following lines describes how to read this data and plot a simple scatter of the probability of fixation at r=2 vs biconnectivity:
import h5py as h5
import matplotlib.pyplot as plt
infile = h5.File('fp_le10.hdf5', 'r')
data = infile['FP'][:]
infile.close()
plt.plot( data['FP_2.0'], data['is_biconnected'], 'o' )
plt.show()
Experiment data files

The fixation probabilities of all undirected graphs with 10 or less vertices + some statistics and measures of the graphs
Related links
Latest version

Version 2
20170209
Published: 20170209
DOI: 10.17632/587bnf6mt3.2
Cite this dataset
Alcalde Cuesta, Fernando; González Sequeiros, Pablo; Lozano Rojo, Álvaro; Vigara Benito, Rubén (2017), “Data of "An accurate database of the fixation probabilities for all undirected graphs of order 10 or less"”, Mendeley Data, v2 http://dx.doi.org/10.17632/587bnf6mt3.2
Previous versions
Compare to version
Categories
Licence
The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.
What does this mean?
Unless indicated otherwise, you can share, copy and modify the images or other third party material in this article so long as you give appropriate credit, provide a link to the license, and indicate if changes were made. If the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material.