Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Approximating fixation probabilities in the generalized Moran process

Autor
Diaz, J.; Goldberg, L.; Mertzios, G.B.; Richerby, D.; Serna, M.; Spirakis, P.G.
Tipus d'activitat
Article en revista
Revista
Algorithmica
Data de publicació
2014-05-01
Volum
69
Número
1
Pàgina inicial
78
Pàgina final
91
DOI
https://doi.org/10.1007/s00453-012-9722-7 Obrir en finestra nova
Resum
We consider the Moran process, as generalized by Lieberman et al. (Nature 433:312-316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, an individual is chosen at random with probability proportional to its assigned "fitness" value. It reproduces, placing a copy of itself on a neighbouring vertex chosen uniformly at random, replacing the individual that was there. The initial population consists of a single mutant of fitness r > 0 place...
Paraules clau
ALGORITHMS, Approximation algorithm, DRIFT ANALYSIS, DYNAMICS, EVOLUTIONARY GAMES, Evolutionary dynamics, FINITE POPULATIONS, GRAPHS, Markov-chain Monte Carlo, SOCIAL NETWORKS, TIME
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants