Highly Influenced

# 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} }

- Published 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

#### From This Paper

##### Figures, tables, and topics from this paper.

16 Citations

17 References

Similar Papers