Absorption time of the Moran process
- Submitting institution
-
The University of Essex
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1389
- Type
- D - Journal article
- DOI
-
10.1002/rsa.20617
- Title of journal
- Random Structures and Algorithms
- Article number
- -
- First page
- 137
- Volume
- 49
- Issue
- 1
- ISSN
- 1042-9832
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
A - Artificial Intelligence (AI)
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The Moran process is a randomized algorithm modelling how genetic mutations spread through spatially structured populations. The work presented the first analysis of the algorithm's running time when the population structure may have one-way links, showing that the population may take exponentially longer to stabilize than when all links are two-way. Significantly, rigour was ensured via formal proofs for all results, including a number of fundamental properties of the process, which previous authors had just assumed true i.e. importantly formalizing existing intuitive arguments. One of these answered an open question in a widely cited survey of Shakarian et al. (https://doi.org/10.1016/j.biosystems.2011.09.006).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -