Earlier Version

# The complexity of evolution on graphs

Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.

Download

*Technical Report*|

*Published*|

*English*

Author

Department

Series Title

IST Austria Technical Report

Abstract

Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are: (1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure). (2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.

Publishing Year

Date Published

2014-04-18

Page

27

ISSN

IST-REx-ID

### Cite this

Chatterjee K, Ibsen-Jensen R, Nowak M.

*The Complexity of Evolution on Graphs*. IST Austria; 2014. doi:10.15479/AT:IST-2014-190-v2-2Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014).

*The complexity of evolution on graphs*. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak.

*The Complexity of Evolution on Graphs*. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.K. Chatterjee, R. Ibsen-Jensen, and M. Nowak,

*The complexity of evolution on graphs*. IST Austria, 2014.Chatterjee, Krishnendu, et al.

*The Complexity of Evolution on Graphs*. IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.**All files available under the following license(s):**

**Copyright Statement:**

**This Item is protected by copyright and/or related rights.**[...]

**Main File(s)**

File Name

IST-2014-190-v2+2_main_full.pdf
443.53 KB

Access Level

Open Access

Date Uploaded

2018-12-12

MD5 Checksum

42f3d8b563286eb0d903832bd9a848d3

File Name

IST-2014-190-v1+1_main_full.pdf
440.91 KB

Access Level

Open Access

Date Uploaded

2019-09-06

MD5 Checksum

0c9a2fd822309719634495a35957e34d

**Material in ISTA:**

**Later Version**

**Later Version**