Amplifiers for the Moran process
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 208378656
- Type
- D - Journal article
- DOI
-
10.1145/3019609
- Title of journal
- Journal of the ACM
- Article number
- -
- First page
- 1
- Volume
- 64
- Issue
- 1
- ISSN
- 0004-5411
- Open access status
- Technical exception
- Month of publication
- March
- Year of publication
- 2017
- 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
-
4
- Research group(s)
-
D - Fundamentals of Computing
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper corrected a faulty proof in a seminal Nature paper (Lieberman etc. 2004). A preliminary version won Best Paper Prize at ICALP (track A), and it was subsequently published in the Journal of the ACM. Together with follow-up work in Random Structures and Algorithms and Theoretical Computer Science, it almost completely answers the question: how much can population structure affect how likely it is, and how long it takes, for a genetic mutation to become widespread under the graph Moran process? It was instrumental in four of its authors attaining permanent positions at Oxford, Bristol, Potsdam and Essex.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -