Categorizing update mechanisms for graph-structured metapopulations

被引:12
|
作者
Yagoobi, Sedigheh [1 ]
Sharma, Nikhil [1 ]
Traulsen, Arne [1 ]
机构
[1] Max Planck Inst Evolutionary Biol, Dept Evolutionary Theory, August Thienemann Str 2, D-24306 Plon, Germany
关键词
evolutionary graph theory; graph-structured metapopulation; network-structured metapopulation; update mechanism; FIXATION PROBABILITY; EVOLUTIONARY DYNAMICS; POPULATION; MUTANT; COOPERATION; NETWORKS; CANCER; GENES; GAMES; MODEL;
D O I
10.1098/rsif.2022.0769
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The structure of a population strongly influences its evolutionary dynamics. In various settings ranging from biology to social systems, individuals tend to interact more often with those present in their proximity and rarely with those far away. A common approach to model the structure of a population is evolutionary graph theory. In this framework, each graph node is occupied by a reproducing individual. The links connect these individuals to their neighbours. The offspring can be placed on neighbouring nodes, replacing the neighbours-or the progeny of its neighbours can replace a node during the course of ongoing evolutionary dynamics. Extending this theory by replacing single individuals with subpopulations at nodes yields a graph-structured metapopulation. The dynamics between the different local subpopulations is set by an update mechanism. There are many such update mechanisms. Here, we classify update mechanisms for structured metapopulations, which allows to find commonalities between past work and illustrate directions for further research and current gaps of investigation.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] Extending Complex Event Processing to Graph-structured Information
    Barquero, Gala
    Burgueno, Loli
    Troya, Javier
    Vallecillo, Antonio
    [J]. 21ST ACM/IEEE INTERNATIONAL CONFERENCE ON MODEL DRIVEN ENGINEERING LANGUAGES AND SYSTEMS (MODELS 2018), 2018, : 166 - 175
  • [42] Dual Averaging Method for Online Graph-structured Sparsity
    Zhou, Baojian
    Chen, Feng
    Ying, Yiming
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 436 - 446
  • [43] EXPONENTIAL DECAY OF SENSITIVITY IN GRAPH-STRUCTURED NONLINEAR PROGRAMS
    Shin, Sungho
    Anitescu, Mihai
    Zavala, Victor M.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (02) : 1156 - 1183
  • [44] GRAPH-STRUCTURED SPARSE REGULARIZATION VIA CONVEX OPTIMIZATION
    Kuroda, Hiroki
    Kitahara, Daichi
    [J]. 2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, : 5538 - 5542
  • [45] A pedagogical view on software modeling and graph-structured diagrams
    Tamai, Tetsuo
    [J]. Software Engineering Education in the Modern Age, 2006, 4309 : 59 - 70
  • [46] Large vocabulary word recognition based on a graph-structured dictionary
    Minamino, K
    [J]. ICSLP 96 - FOURTH INTERNATIONAL CONFERENCE ON SPOKEN LANGUAGE PROCESSING, PROCEEDINGS, VOLS 1-4, 1996, : 2123 - 2126
  • [47] Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization
    Zhou, Baojian
    Chen, Feng
    Ying, Yiming
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [48] Expressive Languages for Path Queries over Graph-Structured Data
    Barcelo, Pablo
    Libkin, Leonid
    Lin, Anthony W.
    Wood, Peter T.
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2012, 37 (04):
  • [49] Labeling scheme and structural joins for graph-structured XML data
    Wang, HZ
    Wang, W
    Lin, XM
    Li, JZ
    [J]. WEB TECHNOLOGIES RESEARCH AND DEVELOPMENT - APWEB 2005, 2005, 3399 : 277 - 289
  • [50] Open Vocabulary Learning on Source Code with a Graph-Structured Cache
    Cvitkovic, Milan
    Singh, Badal
    Anandkumar, Anima
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97