Strong bounds for evolution in networks
From MaRDI portal
Publication:5327474
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)
Recommendations
Cited in
(16)- Strong bounds for evolution in networks
- Asymptotically optimal amplifiers for the Moran process
- Amplifiers for the Moran process
- Natural models for evolution on networks
- Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process
- Amplifiers for the Moran process
- Amplifiers of selection
- Fixation probability in evolutionary dynamics on switching temporal networks
- Fixation probability on clique-based graphs
- Fixation probabilities on superstars, revisited and revised
- Approximating fixation probabilities in the generalized Moran process
- 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
- scientific article; zbMATH DE number 7204395 (Why is no real title available?)
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)