Strong bounds for evolution in networks
DOI10.1007/978-3-642-39212-2_58zbMATH Open1335.68187OpenAlexW2205121374MaRDI QIDQ5327474FDOQ5327474
Authors: George B. Mertzios, P. G. Spirakis 
Publication date: 7 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/13470/1/13470.pdf
Recommendations
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cited In (15)
- Strong bounds for evolution in networks
- Asymptotically optimal amplifiers for the Moran process
- Amplifiers for the Moran process
- Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process
- Natural models for evolution on networks
- Amplifiers for the Moran process
- Amplifiers of selection
- Fixation probability in evolutionary dynamics on switching temporal networks
- Approximating fixation probabilities in the generalized Moran process
- Fixation probability on clique-based graphs
- Fixation probabilities on superstars, revisited and revised
- Approximating fixation probabilities in the generalized Moran process
- An asymptotic expression for the fixation probability of a mutant in star graphs
- Birth-death fixation probabilities for structured populations
- Evolutionary dynamics on graphs -- the effect of graph structure and initial placement on mutant spread
This page was built for publication: Strong bounds for evolution in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327474)
