arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.01015math.PRmath.COq-bio.PE
收藏

分裂漂移随机图,一个物种形成的零模型

The split-and-drift random graph, a null model for speciation

François Bienvenu, Florence Débarre, Amaury Lambert

摘要:

我们引入了一个新的随机图模型的生物学问题有关的物种形成的动机。这个随机图被定义为$\{1, \ldots, n\}$上的图空间上的马尔可夫链的平稳分布。该马尔可夫链的动态由两种类型的事件支配:顶点复制,其中以恒定速率对一对顶点进行均匀采样,其中一个顶点失去其入射边并重新连接到另一个顶点及其邻居;以及边移除,其中每个边以恒定速率消失。除了顶点数$n$之外,模型还有一个参数$r_n$。使用合并的方法,我们得到了明确的公式的几个图的不变量,如边的数量或顺序$k$的完全子图的数量的第一时刻。然后,这些被用来确定五个非平凡的制度取决于参数$r_n$的渐近。我们推导出一个明确的度分布的表达式,并表明,在适当的重新缩放,它收敛到经典的分布时,顶点的数量趋于无穷大。最后,我们给出了渐近界的连通分量的数量,并表明,在稀疏制度的边缘的数量是泊松。

英文摘要:

We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this Markov chain is governed by two types of events: vertex duplication, where at constant rate a pair of vertices is sampled uniformly and one of these vertices loses its incident edges and is rewired to the other vertex and its neighbors; and edge removal, where each edge disappears at constant rate. Besides the number of vertices $n$, the model has a single parameter $r_n$. Using a coalescent approach, we obtain explicit formulas for the first moments of several graph invariants such as the number of edges or the number of complete subgraphs of order $k$. These are then used to identify five non-trivial regimes depending on the asymptotics of the parameter $r_n$. We derive an explicit expression for the degree distribution, and show that under appropriate rescaling it converges to classical distributions when the number of vertices goes to infinity. Finally, we give asymptotic bounds for the number of connected components, and show that in the sparse regime the number of edges is Poissonian.

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

↑