具有可再激发节点的临界网络级联:为什么树状近似通常有效,何时失效以及如何纠正
Critical Network Cascades with Re-excitable nodes: Why tree-like approximations usually work, when they breakdown, and how to correct them
摘要:
网络科学是一个迅速发展的领域,有大量的和不断增长的工作,基于网络的动态过程。这一领域的大多数理论结果依赖于所谓的\emph{locally tree-like approximation}。然而,这通常是一个“不受控制的”近似,在这个意义上,误差的大小通常是未知的,虽然数值结果表明,这种错误往往是令人惊讶的小。在本文中,我们把这种近似更严格的基础上,计算偏离基于树的理论的离散时间临界网络级联与可再激励节点的背景下的幅度。我们讨论的条件下,树状近似计算网络的关键性给出了良好的结果,也解释了偏离这种近似的原因,在某些种类的网络图案的密度。使用这种理解,我们得出的结果适用于一般网络,明确不满足局部树状近似的网络临界。特别是,我们专注于双平行的主题,最小的主题相关的失败的树为基础的理论在这种情况下,我们得到的校正,由于这样的主题的临界条件。我们在计算机生成的网络上验证了我们的主张,并且我们证实我们的理论准确地预测了观察到的偏离临界状态的情况。使用我们的理论,我们解释了为什么数值模拟经常显示,从基于树的理论的偏差是令人惊讶的小。更具体地说,我们表明,这些偏差是可以忽略不计的网络,其平均度甚至是适度的大相比,一个,证明了为什么基于树的理论似乎对大多数现实世界的网络工作得很好。
英文摘要:
Network science is a rapidly expanding field, with a large and growing body of work on network-based dynamical processes. Most theoretical results in this area rely on the so-called \emph{locally tree-like approximation}. This is, however, usually an `uncontrolled' approximation, in the sense that the magnitudes of the error are typically unknown, although numerical results show that this error is often surprisingly small. In this paper, we place this approximation on more rigorous footing by calculating the magnitude of deviations away from tree-based theories in the context of discrete-time critical network cascades with re-excitable nodes. We discuss the conditions under which tree-like approximations give good results for calculating network criticality, and also explain the reasons for deviation from this approximation, in terms of the density of certain kinds of network motifs. Using this understanding, we derive results for network criticality that apply to general networks that explicitly do not satisfy the locally tree-like approximation. In particular, we focus on the bi-parallel motif, the smallest motif relevant to the failure of a tree-based theory in this context, and we derive the corrections due to such motifs on the conditions for criticality. We verify our claims on computer-generated networks, and we confirm that our theory accurately predicts the observed deviations from criticality. Using our theory, we explain why numerical simulations often show that deviations from a tree-based theory are surprisingly small. More specifically, we show that these deviations are negligible for networks whose average degree is even modestly large compared to one, justifying why tree-based theories appear to work well for most real-world networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。