Recent Work on Evolution in Networks
Dr. George Mertzios (Durham University)
Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described by the Moran Process. This approach has been recently generalized by Lieberman, Hauert and Nowak [Nature, 2005], by arranging individuals on the nodes of a network. One of the main quantities of interest is the fixation probability, i.e. the probability that the system reaches a state where the mutant takes over the whole network. We provide an overview of recent results on upper/lower bounding the fixation probability and on efficiently computing the fixation probability in undirected networks. Furthermore we introduce the notion of selective amplifiers and selective suppressors of evolution, which provides a measure for the number of "strong starts" and "weak starts" for the mutant in the network. This is recent joint work with (a) S. Nikoletseas, C. Raptopoulos, and P.G. Spirakis [Theoretical Computer Science 2013], with (b) J. Diaz, L.A. Goldberg, D. Richerby, M. Serna, and P.G. Spirakis [Algorithmica 2014], and with (c) P.G. Spirakis [ICALP 2013].
Back to the research colloquium site.