arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.2533cs.GTcs.SIq-bio.PE
收藏

演化图论问题的一种新分析方法

A Novel Analytical Method for Evolutionary Graph Theory Problems

Paulo Shakarian, Patrick Roos, Geoffrey Moores

摘要:

进化图论研究的是图上种群的进化动力学。一个核心问题是确定少数突变体超越种群的概率。目前,蒙特卡罗模拟用于估计一般有向图上的固定概率,因为没有好的分析方法存在。在本文中,我们介绍了一种新的确定性框架计算固定概率的强连接,有向,加权进化图下中立漂移。我们展示了这个框架如何也可以用来计算在给定的时间步长的突变体的预期数量(即使我们放松图是强连通的假设),它如何扩展到其他相关模型(例如投票者模型),我们的框架如何在有利突变体的情况下为固定概率提供非平凡的界限,以及如何使用它来找到平均注视时间的非平凡下限。我们提供了各种实验结果,确定固定概率和预期数量的突变体在不同的图形。其中,我们表明,我们的方法始终优于Monte Carlo模拟的速度由几个数量级。最后,我们展示了我们的方法如何在神经学中提供对突触竞争的洞察。

英文摘要:

Evolutionary graph theory studies the evolutionary dynamics of populations structured on graphs. A central problem is determining the probability that a small number of mutants overtake a population. Currently, Monte Carlo simulations are used for estimating such fixation probabilities on general directed graphs, since no good analytical methods exist. In this paper, we introduce a novel deterministic framework for computing fixation probabilities for strongly connected, directed, weighted evolutionary graphs under neutral drift. We show how this framework can also be used to calculate the expected number of mutants at a given time step (even if we relax the assumption that the graph is strongly connected), how it can extend to other related models (e.g. voter model), how our framework can provide non-trivial bounds for fixation probability in the case of an advantageous mutant, and how it can be used to find a non-trivial lower bound on the mean time to fixation. We provide various experimental results determining fixation probabilities and expected number of mutants on different graphs. Among these, we show that our method consistently outperforms Monte Carlo simulations in speed by several orders of magnitude. Finally we show how our approach can provide insight into synaptic competition in neurology.

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

↑