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

布尔网络退火逼近的超临界性

Supercriticality of Annealed Approximations of Boolean Networks

Thomas Mountford, Daniel Valesin

摘要:

我们考虑Chatterjee和Durrett最近提出的模型[CD 2011]作为布尔网络的“退火近似”,布尔网络是随机图上的一类细胞自动机,如S.考夫曼[K69]。起点是一个由$n$顶点组成的随机有向图,每个顶点都有$r$输入顶点指向它.对于[CD 2011]的模型,在这个图上考虑一个离散时间阈值接触过程:在每个时刻,每个顶点都有概率$q$选择接收输入;如果是,并且如果其输入顶点中的至少一个在先前时刻处于状态1,则将其标记为1;在所有其他情况下,将其标记为0。$r$和$q$保持固定,而$n$取无穷大。改进了[CD 2011]的一个结果,我们证明了,如果$qr > 1$,那么在$n$中动力学活动的持续时间是指数的。

英文摘要:

We consider a model recently proposed by Chatterjee and Durrett [CD2011] as an "annealed approximation" of boolean networks, which are a class of cellular automata on a random graph, as defined by S. Kauffman [K69]. The starting point is a random directed graph on $n$ vertices; each vertex has $r$ input vertices pointing to it. For the model of [CD2011], a discrete time threshold contact process is then considered on this graph: at each instant, each vertex has probability $q$ of choosing to receive input; if it does, and if at least one of its input vertices were in state 1 at the previous instant, then it is labelled with a 1; in all other cases, it is labelled with a 0. $r$ and $q$ are kept fixed and $n$ is taken to infinity. Improving a result of [CD2011], we show that if $qr > 1$, then the time of persistence of activity of the dynamics is exponential in $n$.

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

↑