Fixation probabilities for simple digraphs
DOI10.1098/rspa.2012.0676zbMath1348.05092OpenAlexW2139738313MaRDI QIDQ2831255
Alex Murray, Burton H. Voorhees
Publication date: 2 November 2016
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.2012.0676
Problems related to evolution (92D15) Random graphs (graph-theoretic aspects) (05C80) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Directed graphs (digraphs), tournaments (05C20)
Related Items (12)
Cites Work
- Entropy and the complexity of graphs revisited
- Exact epidemic models on graphs using graph-automorphism driven lumping
- Directionality of contact networks suppresses selection pressure in evolutionary dynamics
- Natural models for evolution on networks
- Two results on evolutionary processes on general non-directed graphs
- Evolutionary dynamics on small-order graphs
- Rumors in a Network: Who's the Culprit?
- Birth–death fixation probabilities for structured populations
- An analysis of the fixation probability of a mutant on special classes of non-directed graphs
This page was built for publication: Fixation probabilities for simple digraphs