Skip to main content
. 2024 Jul 18;20(7):e1012299. doi: 10.1371/journal.pcbi.1012299

Fig 5. Fixation time on slow oriented graphs.

Fig 5

a, The Fan graph with k blades has N = 2k + 1 nodes and 3k one-way edges (here k = 5 which yields N = 11). The Vortex graph with batch size k has N = 2k + 2 nodes and 4k edges (here k = 3 which yields N = 8). b-c, For both the Fan graphs and the Vortex graphs the fixation time scales roughly as N2, both for r = 1.1 and r = 100. (Each data point is an average over 1000 simulations).