From EvoLudo
537 bytes added ,  19:57, 30 August 2016
== [[Evolutionary graph theory]] ==
| style="vertical-align:top" |[[Image:EGT - Superstargraph (N=484, B=21, k=6).svg|160px|left|link=Evolutionary graph theory]]| style="vertical-align:top" |Tutorial on evolutionary graph theory, which provides a formal approach to describe the spreading and fixation (or extinction) of a mutant type in a resident population. The structure of the population is represented as a graph where nodes represent individuals and edges define the neighbourhood of each individual. Interestingly, while the fixation probabilities remain unaffected by the underlying population structure for a large class of graphs, some graphs may act either as amplifiers or suppressors of selection by increasing or decreasing the fixation probabilities as compared to unstructured populations. In contrast, fixation and absorption times are very sensitive to changes in the graph structure and hence vary greatly even for graphs that leave fixation probabilities unchanged. Even though fixation times are, in general, not preserved between graphs, symmetries of a graph can at least ensure that fixation times do not depend on the initial location of the the mutant.
<div class="footnote" style="font-size:smaller">
#Lieberman, E., Hauert, C. & Nowak, M. (2005) ''Nature'' '''433''' 312-316 [ doi: 10.1038/nature03204].
#Jamieson-Lane, A. & Hauert, C. (2015) ''J. Theor. Biol.'' '''382''' 44-56 [ doi: 10.1016/j.jtbi.2015.06.029].
#McAvoy, A. & Hauert, C. (2015) ''J. R. Soc. Interface'' '''12''' 20150420 [ doi: 10.1098/rsif.2015.0420]
== [[Stochastic dynamics in finite populations]] ==