Computer Science – Computational Complexity
Scientific paper
2011-11-14
Computer Science
Computational Complexity
14 pages. Equality in Lemma 3 made non-strict; corrected complexity bound for r=1 case (Theorem 9, Corollary 10, Theorem 11)
Scientific paper
We consider the Moran process, as generalized by Lieberman, Hauert and Nowak (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$ placed uniformly at random, with every other vertex occupied by an individual of fitness 1. The main quantities of interest are the probabilities that the descendants of the initial mutant come to occupy the whole graph (fixation) and that they die out (extinction); almost surely, these are the only possibilities. In general, exact computation of these quantities by standard Markov chain techniques requires solving a system of linear equations of size exponential in the order of the graph so is not feasible. We show that, with high probability, the number of steps needed to reach fixation or extinction is bounded by a polynomial in the number of vertices in the graph. This bound allows us to construct fully polynomial randomized approximation schemes (FPRAS) for the probability of fixation (when $r\geq 1$) and of extinction (for all $r>0$).
Diaz Josep
Goldberg Leslie Ann
Mertzios George B.
Richerby David
Serna Maria
No associations
LandOfFree
Approximating Fixation Probabilities in the Generalized Moran Process does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximating Fixation Probabilities in the Generalized Moran Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Fixation Probabilities in the Generalized Moran Process will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-219131