< Back to Article

Invasion and effective size of graph-structured populations

Fig 5

Effective size in networks under Birth-death update.

The average effective size for three kinds of networks is computed in a random sample (with replacement) of 100 connected networks for each size and network kind. Dashed lines indicate N_e = N and . For random networks, the probability of including an edge in the Erdős-Réyni algorithm was set to 0.75. For small-world networks, a 4-neighbors lattice was generated with a probability of 0.2 of link rewiring. Scale-free networks were generated by linear preferential attachment [39]. Random networks and small-world networks have an average effective size exactly aligned with that of a complete graph.

doi: https://doi.org/10.1371/journal.pcbi.1006559.g005