Fast and deterministic computation of fixation probability in evolutionary graphs

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

Volumn , Issue , 2011, Pages 97-104

  Shakarian, Paulo ^a   Roos, Patrick ^b  

^a UNITED STATES MILITARY ACADEMY   (United States)

^b Institute of Advanced Computer Science   (United States)

Author keywords

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

Indexed keywords

ANALYTICAL METHOD; DETERMINISTIC ALGORITHMS; LOWER BOUNDS; MODELLING OF EVOLUTION; MONTE CARLO SIMULATION; NETWORK SCIENCE; ORDERS OF MAGNITUDE; STRONGLY CONNECTED;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; COMPUTER SIMULATION; MONTE CARLO METHODS; PROBABILITY; STOCHASTIC MODELS;

DIRECTED GRAPHS;

EID: 84856667771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.2316/P.2011.753-012     Document Type: Conference Paper

References (16)

1. E. Lieberman, C. Hauert, M. A. Nowak, Evolutionary dynamics on graphs, Nature 433 (7023), 2005, 312-316. (Pubitemid 40164036)
2. P. A. Zhang, P. Y. Nie, D. Q. Hu, F. Y. Zou, The analysis of bi-level evolutionary graphs., Biosystems 90 (3) 2007, 897-902.
3. V. Sood, T. Antal, S. Redner, Voter models on heterogeneous networks, Physical Review E 77 (4) 2008, 041121.
4. J. M. Pacheco, A. Traulsen, M. A. Nowak, Active linking in evolutionary games, Journal of Theoretical Biology (3) 2006, 437-443. (Pubitemid 44647323)
5. T. Antal, S. Redner, V. Sood, Evolutionary dynamics on degree-heterogeneous graphs, Physical Review Letters 96 (18) 2006, 188104.
6. M. Broom, C. Hadjichrysanthou, J. Rychtar, B. T. Stadler, Two results on evolutionary processes on general non-directed graphs, Proceedings of the Royal Society A 466 (2121) 2010, 2795-2798.
7. N. Masuda, H. Ohtsuki, Evolutionary dynamics and fixation probabilities in directed networks, New Journal of Physics 11 (3) 2009, 033012.
8. J. Rychtář, B. Stadler, Evolutionary dynamics on small-world networks, International Journal of Computational and Mathematical Sciences 2 (1).
9. M. Broom, J. Rychtář, An analysis of the fixation probability of a mutant on special classes of nondirected graphs, Proceedings of the Royal Society A 464 2009, 2609-2627.
10. V. C. Barbosa, R. Donangelo, S. R. Souza, Early appraisal of the fixation probability in directed networks, Physical Review E 82 (4) 2010, 046114.
11. N. Masuda, Directionality of contact networks suppresses selection pressure in evolutionary dynamics, Journal of Theoretical Biology 258 (2) 2009, 323-334.
12. P. Moran, Random processes in genetics, Mathematical Proceedings of the Cambridge Philosophical Society 54 (01) 1958, 60-71.
13. H. Jeong, Z. Neda, A. L. Barabasi, Measuring preferential attachment in evolving networks, EPL (Europhysics Letters) 61 (4) 2003, 567.
14. B. Houchmandzadeh, M. Vallade, The fixation probability of a beneficial mutation in a geographically structured population, New Journal of Physics 13 (7) 2011, 073020.
15. D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in: KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, NY, USA, 2003, pp. 137-146.
16. P. Shakarian, V. Subrahmanian, M. L. Sapino, Using generalized annotated programs to solve social network optimization problems, in: M. Hermenegildo, T. Schaub (Eds.), Technical Communications of the 26th International Conference on Logic Programming, Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, 2010, pp. 182-191.