Fast and deterministic computation of fixation probability in evolutionary graphs

Paulo Shakarian, Patrick Roos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

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 evolutionary graphs under the case of neutral drift, which we show to be a lower bound for the case where the mutant is more fit than the rest of the population (previously, this was only observed from simulation). We also show that, in neutral drift, fixation probability is additive under the weighted, directed case. We implement our algorithm and show experimentally that it consistently outperforms Monte Carlo simulations by several orders of magnitude, which can allow researchers to study fixation probability on much larger graphs.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011
Pages97-104
Number of pages8
DOIs
StatePublished - 2011
Externally publishedYes
Event6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011 - Pittsburgh, PA, United States
Duration: Nov 7 2011Nov 9 2011

Other

Other6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011
CountryUnited States
CityPittsburgh, PA
Period11/7/1111/9/11

Fingerprint

Directed graphs
Graph theory
Population
Research Personnel
Monte Carlo simulation

Keywords

  • Modelling of evolution
  • Network diffusion
  • Network science
  • Stochastic models

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Health Information Management

Cite this

Shakarian, P., & Roos, P. (2011). Fast and deterministic computation of fixation probability in evolutionary graphs. In Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011 (pp. 97-104) https://doi.org/10.2316/P.2011.753-012

Fast and deterministic computation of fixation probability in evolutionary graphs. / Shakarian, Paulo; Roos, Patrick.

Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011. 2011. p. 97-104.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shakarian, P & Roos, P 2011, Fast and deterministic computation of fixation probability in evolutionary graphs. in Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011. pp. 97-104, 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011, Pittsburgh, PA, United States, 11/7/11. https://doi.org/10.2316/P.2011.753-012
Shakarian P, Roos P. Fast and deterministic computation of fixation probability in evolutionary graphs. In Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011. 2011. p. 97-104 https://doi.org/10.2316/P.2011.753-012
Shakarian, Paulo ; Roos, Patrick. / Fast and deterministic computation of fixation probability in evolutionary graphs. Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011. 2011. pp. 97-104
@inproceedings{e5212009ac53488b98a83b6ccabde531,
title = "Fast and deterministic computation of fixation probability in evolutionary graphs",
abstract = "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 evolutionary graphs under the case of neutral drift, which we show to be a lower bound for the case where the mutant is more fit than the rest of the population (previously, this was only observed from simulation). We also show that, in neutral drift, fixation probability is additive under the weighted, directed case. We implement our algorithm and show experimentally that it consistently outperforms Monte Carlo simulations by several orders of magnitude, which can allow researchers to study fixation probability on much larger graphs.",
keywords = "Modelling of evolution, Network diffusion, Network science, Stochastic models",
author = "Paulo Shakarian and Patrick Roos",
year = "2011",
doi = "10.2316/P.2011.753-012",
language = "English (US)",
isbn = "9780889869042",
pages = "97--104",
booktitle = "Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011",

}

TY - GEN

T1 - Fast and deterministic computation of fixation probability in evolutionary graphs

AU - Shakarian, Paulo

AU - Roos, Patrick

PY - 2011

Y1 - 2011

N2 - 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 evolutionary graphs under the case of neutral drift, which we show to be a lower bound for the case where the mutant is more fit than the rest of the population (previously, this was only observed from simulation). We also show that, in neutral drift, fixation probability is additive under the weighted, directed case. We implement our algorithm and show experimentally that it consistently outperforms Monte Carlo simulations by several orders of magnitude, which can allow researchers to study fixation probability on much larger graphs.

AB - 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 evolutionary graphs under the case of neutral drift, which we show to be a lower bound for the case where the mutant is more fit than the rest of the population (previously, this was only observed from simulation). We also show that, in neutral drift, fixation probability is additive under the weighted, directed case. We implement our algorithm and show experimentally that it consistently outperforms Monte Carlo simulations by several orders of magnitude, which can allow researchers to study fixation probability on much larger graphs.

KW - Modelling of evolution

KW - Network diffusion

KW - Network science

KW - Stochastic models

UR - http://www.scopus.com/inward/record.url?scp=84856667771&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856667771&partnerID=8YFLogxK

U2 - 10.2316/P.2011.753-012

DO - 10.2316/P.2011.753-012

M3 - Conference contribution

AN - SCOPUS:84856667771

SN - 9780889869042

SP - 97

EP - 104

BT - Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011

ER -