Absorption time of the Moran process
From MaRDI portal
Publication:2818278
DOI10.1002/rsa.20617zbMath1344.05135arXiv1311.7631OpenAlexW2964124513MaRDI QIDQ2818278
David Richerby, Leslie Ann Goldberg, Maria J. Serna, Josep Diaz
Publication date: 7 September 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.7631
Problems related to evolution (92D15) Population dynamics (general) (92D25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (6)
A survey of the modified Moran process and evolutionary graph theory ⋮ Wald’s martingale and the conditional distributions of absorption time in the Moran process ⋮ Asymptotically optimal amplifiers for the Moran process ⋮ Unnamed Item ⋮ An extension of the Moran process using type-specific connection graphs ⋮ Bernoulli and binomial proliferation on evolutionary graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evolutionary game dynamics in finite populations
- Approximating fixation probabilities in the generalized Moran process
- Fixation probabilities on superstars, revisited and revised
- Fixation of strategies for an evolutionary game in finite populations
- The isoperimetric number of random regular graphs
- Cubic graphs and the first eigenvalue of a Riemann surface
- The bisection width and the isoperimetric number of arrays.
- Dynamic monopolies of constant size
- Natural models for evolution on networks
- Isoperimetric numbers of graphs
- Gossip Algorithms
- Evolutionary games on graphs and the speed of the evolutionary process
- On the fixation probability of superstars
- Probability and Computing
- An analysis of the fixation probability of a mutant on special classes of non-directed graphs
This page was built for publication: Absorption time of the Moran process
