English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Exact numerical calculation of fixation probability and time on graphs

Hindersin, L., Möller, M., Traulsen, A., & Bauer, B. (2016). Exact numerical calculation of fixation probability and time on graphs. Biosystems [Elektronische Ressource]: Journal of Biological and Information Processing Sciences, 150, 87-91. doi:10.1016/j.biosystems.2016.08.010.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-002C-3AD8-4 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-002D-1F30-F
Genre: Journal Article

Files

show Files

Locators

show
hide
Description:
-

Creators

show
hide
 Creators:
Hindersin, Laura1, Author              
Möller, Marius, Author
Traulsen, Arne1, Author              
Bauer, Benedikt1, Author              
Affiliations:
1Department Evolutionary Theory, Max Planck Institute for Evolutionary Biology, Max Planck Society, ou_1445641              

Content

show
hide
Free keywords: calculation; probability
 Abstract: The Moran process on graphs is a popular model to study the dynamics of evolution in a spatially structured population. Exact analytical solutions for the fixation probability and time of a new mutant have been found for only a few classes of graphs so far. Simulations are time-expensive and many realizations are necessary, as the variance of the fixation times is high. We present an algorithm that numerically computes these quantities for arbitrary small graphs by an approach based on the transition matrix. The advantage over simulations is that the calculation has to be executed only once. Building the transition matrix is automated by our algorithm. This enables a fast and interactive study of different graph structures and their effect on fixation probability and time. We provide a fast implementation in C with this note (Hindersin et al., 2016). Our code is very flexible, as it can handle two different update mechanisms (Birth–death or death–Birth), as well as arbitrary directed or undirected graphs. © 2016 Elsevier Ireland Ltd

Details

show
hide
Language(s): eng - English
 Dates: 2016-06-262016-01-252016-08-182016-08-202016
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: DOI: 10.1016/j.biosystems.2016.08.010
BibTex Citekey: Hindersin201687
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Biosystems [Elektronische Ressource] : Journal of Biological and Information Processing Sciences
  Other : Biosystems
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Ireland, etc. : Elsevier
Pages: - Volume / Issue: 150 Sequence Number: - Start / End Page: 87 - 91 Identifier: ISSN: 0303-2647
CoNE: /journals/resource/954925510418