arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.4563cond-mat.dis-nn
收藏

动态网络与定向渗流

Dynamic networks and directed percolation

Roni Parshani, Mark Dickison, Reuven Cohen, H. Eugene Stanley, Shlomo Havlin

摘要:

我们介绍了一个模型的动态网络,其中的链接或链接的强度随时间而变化。我们通过将动态网络映射到定向渗流问题来解决该模型,其中方向对应于网络在时间上的演化。我们表明,动态网络在临界浓度$p_c$,这降低了网络链接的变化率$r$的渗流相变。临界附近的行为是普遍的,与$r$无关。我们发现基本的网络定律发生了变化。(i)对于Erdens-Rényi网络,我们发现对于$r$的所有值,巨分支在临界时的大小与网络大小$N$成比例,而不是与$N^{2/3}$成比例。(ii)在存在广泛的无序分布的情况下,与静态网络中的$N^{1/3}$相比,动态网络中两个节点之间的最佳路径长度缩放为$N^{1/2}$。

英文摘要:

We introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the evolution of the network in time. We show that the dynamic network undergoes a percolation phase transition at a critical concentration $p_c$, which decreases with the rate $r$ at which the network links are changed. The behavior near criticality is universal and independent of $r$. We find fundamental network laws are changed. (i) For Erdős-Rényi networks we find that the size of the giant component at criticality scales with the network size $N$ for all values of $r$, rather than as $N^{2/3}$. (ii) In the presence of a broad distribution of disorder, the optimal path length between two nodes in a dynamic network scales as $N^{1/2}$, compared to $N^{1/3}$ in a static network.

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

↑