#5469. An extension of the Moran process using type-specific connection graphs

August 2026publication date
Proposal available till 19-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Applied Mathematics;
Computational Theory and Mathematics;
Theoretical Computer Science;
Computer Networks and Communications;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №5469.1 Contract №5469.2 Contract №5469.3 Contract №5469.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
The Moran process, as studied by Lieberman, Hauert and Nowak (20XX) [1], is a birth-death process that models the spread of mutations in two-type populations (residents-mutants) whose structure is defined by a digraph. The process central notion is the probability that a randomly placed mutant will occupy the whole vertex set (fixation probability). We extend this model by considering type-specific graphs, and consequently present results on the fundamental problems related to the fixation probability and its computation. Finally, we view the resident-mutant competing forces as players that choose digraphs and indicate that the mutants complete graph is a dominant strategy.
Keywords:
Evolutionary dynamics; Fixation probability; Moran process

Contacts :
0