Evolutionary Dynamics on Degree-Heterogeneous Graphs
نویسندگان
چکیده
منابع مشابه
Evolutionary dynamics on degree-heterogeneous graphs.
The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model dynamics) or by an individual giving birth to an offspring that takes over a random neighbor node (invasion process dynamics). The fixation probability for one species to ta...
متن کاملEvolutionary Dynamics on Small-order Graphs
We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [Lieberman, E., Hauert, C., Nowak, M.A., 2005. Evolutionary dynamics on graphs. Nature 433, 312-316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability o...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملEvolutionary Stability and the Evolution of Cooperation on Heterogeneous Graphs
Recent studies have revealed that graph heterogeneity can considerably affect evolutionary processes and that it promotes the emergence and maintenance of cooperation in social dilemmas. In this paper, we analytically derive the evolutionary dynamics and the evolutionarily stable strategy (ESS) condition for 2×2 games on heterogeneous graphs based on “pairwise comparison” updating. Using pair a...
متن کاملEvolutionary dynamics on graphs: Efficient method for weak selection.
Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2006
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.96.188104