Asymptotically optimal amplifiers for the Moran process

DOI10.1016/j.tcs.2018.08.005zbMath1422.60124arXiv1611.04209OpenAlexW2963947265WikidataQ129360571 ScholiaQ129360571MaRDI QIDQ1755587

Leslie Ann Goldberg, Florian Meier, John Lapinskas, Johannes Lengler, Pascal Pfister, Konstantinos D. Panagiotou

Publication date: 10 January 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.04209

zbMATH Keywords

Markov chainsextremal graph theoryMoran processfixation probabilitystrong amplifiers

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)

Related Items (3)

A survey of the modified Moran process and evolutionary graph theory ⋮ Fixation probability in evolutionary dynamics on switching temporal networks ⋮ An extension of the Moran process using type-specific connection graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating fixation probabilities in the generalized Moran process
• Fixation probabilities on superstars, revisited and revised
• Natural models for evolution on networks
• Fixation results for threshold voter systems
• The critical contact process dies out
• Absorption time of the Moran process
• Gossip Algorithms
• A proof of alon's second eigenvalue conjecture
• Amplifiers for the Moran Process
• Strong Bounds for Evolution in Networks
• On the fixation probability of superstars

This page was built for publication: Asymptotically optimal amplifiers for the Moran process