Fast and Deterministic Computation of Fixation Probability in Evolutionary Graphs

@inproceedings{Shakarian2011FastAD,
  title={Fast and Deterministic Computation of Fixation Probability in Evolutionary Graphs},
  author={Paulo Shakarian},
  year={2011}
}
In evolutionary graph theory [1] biologists study the problem of determining the probability that a small number of mutants overtake a population that is structured on a weighted, possibly directed graph. Currently Monte Carlo simulations are used for estimating such fixation probabilities on directed graphs, since no good analytical methods exist. In this paper, we introduce a novel deterministic algorithm for computing fixation probabilities for strongly connected directed, weighted… CONTINUE READING
16 Citations
17 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Random processes in genetics

  • P. Moran
  • Mathematical Proceedings of the Cambridge…
  • 1958
Highly Influential
5 Excerpts

An analysis of the fixation probability of a mutant on special classes of nondirected graphs

  • J. Rychtář M. Broom
  • Proceedings of the Royal Society A
  • 2009

Rychtář, An analysis of the fixation probability of a mutant on special classes of nondirected graphs

  • J. M. Broom
  • Proceedings of the Royal Society A
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…