arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.03586q-bio.PEcs.CEmath.DSnlin.AOnlin.CG
收藏

别管那些空操作:通过空间循环博弈实现协同演化物种相互作用模拟的更快、更稳定建模

Never Mind The No-Ops: Faster and Less Volatile Simulation Modelling of Co-Evolutionary Species Interactions via Spatial Cyclic Games

Dave Cliff

AI总结:

本文针对演化空间循环博弈模拟中原始基本步骤算法因大量空操作和空细胞导致的计算低效问题,提出修订基本步骤算法,在保持动力学特征的同时提升稳定性,使总模拟时间减少85%以上。

摘要:

协同演化种群动力学中的问题长期以来通过计算密集型的极简基于智能体的模型模拟进行研究,这类模型被称为演化空间循环博弈(ESCGs),涉及多个相互作用的生物物种,其中每个智能体在规则格点上的一个细胞中拥有自己独特的空间位置,并能随时间从一个细胞移动到另一个细胞。已有许多论文探讨了ESCGs的动力学,其中竞争性物种间捕食者/被捕食者关系通过三物种的石头-剪刀-布(RPS)循环博弈或五物种的石头-剪刀-布-蜥蜴-斯波克(RPSLS)循环博弈进行建模。这些模拟的核心是“基本步骤”(ES),在该步骤中随机选择一个或两个智能体,要么竞争至死,要么繁殖,要么移动位置。ESCG研究通常涉及执行数万亿次ES,因此核心ES算法的计算效率是一个关键问题。在本文中,我证明了事实上的标准“原始ES”(OES)算法在时间和空间上都是计算低效的,原因是隐式执行了许多“空操作”命令(即什么都不做的命令),并且因为在稳态下大量细胞可能为空,而空细胞不起任何作用。我提出了一种新的“修订ES”(RES)算法,该算法消除了这些低效之处,并且我通过实验表明,采用RES的ESCGs表现出与采用OES的ESCGs在定性上相同的特征,同时显著更加稳定。基于RES的模拟具有更稳定的动力学,这意味着它们可以在比使用OES时更小的格点上运行,从而使总模拟时间减少85%或更多。本文实验所开发的Python源代码已在GitHub上免费提供。

英文摘要:

Issues in co-evolutionary population dynamics have long been studied via computationally intensive simulations of minimally simple agent-based models, known as Evolutionary Spatial Cyclic Games (ESCGs), involving multiple interacting biological species in which each agent has its own unique spatial location in a cell on a regular lattice, and can move from cell to cell over time. Many papers have been published exploring the dynamics of ESCGs where competitive inter-species predator/prey relationships are modelled via the cyclic game Rock-Paper-Scissors (RPS) for three species, or Rock-Paper-Scissors-Lizard-Spock (RPSLS) for five. At the core of these simulations is the "Elementary Step" (ES), in which one or two agents are chosen at random to either compete to the death, or to reproduce, or to move location. ESCG studies typically involve executing trillions of ESs and hence the computational efficiency of the core ES algorithm is a key concern. In this paper I demonstrate that the de facto standard "Original ES" (OES) algorithm is computationally inefficient both in time and in space due to the implicit execution of many "no-op" commands (i.e., commands that do nothing) and because at steady state large numbers of cells can be empty, and yet empty cells serve no purpose. I present a new "Revised ES" (RES) algorithm which eliminates these inefficiencies, and I show empirically that ESCGs with RES exhibit qualitatively the same characteristics as those with OES, and are also markedly more stable. The more stable dynamics of RES-based simulations means that they can be run with smaller lattices than when using OES, leading to reductions in total simulation times of 85% or more. Python source code developed for the experiments reported here is freely available on GitHub.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑