arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.5339math.PR
收藏

随机布尔网络的“退火近似”--阈值接触过程的活性持久性

Persistence of Activity in Threshold Contact Processes, an "Annealed Approximation" of Random Boolean Networks

Shirshendu Chatterjee, Rick Durrett

摘要:

我们考虑一个基因调控网络模型,它是Kauffmann(1969)随机布尔网络的一个改进。有三个参数:$n =$表示节点数,$r =$表示每个节点的输入数,$p =$表示每个节点处布尔函数中1的期望分数。遵循物理学文献中的标准实践,我们在$n$节点上的随机图上使用阈值接触过程,其中每个节点都具有$r$度,以近似其动态。我们证明,如果$r\ge 3$和$r \cdot 2p(1-p)>1$,那么阈值接触过程持续很长一段时间,这对应于布尔网络的混沌行为。不幸的是,我们只能证明当$r\cdot 2p(1-p)> 1$时,$b(p)>0$的持续时间是$\ge \exp(cn^{b(p)})$,当$(r-1)\cdot 2p(1-p)>1$时,$b(p)=1$的持续时间是$b(p)=1$。

英文摘要:

We consider a model for gene regulatory networks that is a modification of Kauffmann's (1969) random Boolean networks. There are three parameters: $n =$ the number of nodes, $r =$ the number of inputs to each node, and $p =$ the expected fraction of 1's in the Boolean functions at each node. Following a standard practice in the physics literature, we use a threshold contact process on a random graph on $n$ nodes, in which each node has in degree $r$, to approximate its dynamics. We show that if $r\ge 3$ and $r \cdot 2p(1-p)>1$, then the threshold contact process persists for a long time, which correspond to chaotic behavior of the Boolean network. Unfortunately, we are only able to prove the persistence time is $\ge \exp(cn^{b(p)})$ with $b(p)>0$ when $r\cdot 2p(1-p)> 1$, and $b(p)=1$ when $(r-1)\cdot 2p(1-p)>1$.

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

↑