arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.3750cond-mat.dis-nn
收藏

无序诱导的有限路径渗流

Disorder Induced Limited Path Percolation

Eduardo López, Lidia A. Braunstein

摘要:

我们引入了一个模型的渗流引起的混乱,在一个最初的同质网络的链接等权重是无序的引入异构权重的链接。当引入无序前后两个节点之间的最优路径长度之比α ij增加不超过一个容许比τ时,我们认为一对节点i和j是相互可达的.这些条件比通常的渗透模型更好地反映了可达性的实际限制,通常的渗透模型在定义连接性和通信时完全忽略了路径长度。我们发现,该模型导致一阶相变在2维晶格和Erdos-Renyi网络,在后者的情况下,不连续的大小意味着过渡是有效的灾难性的,几乎所有的系统对经历的变化从可达到不可达。利用无序状态下的最佳路径长度理论,我们可以预测渗流阈值。对于实际网络的变化,而在操作中,该模型应该表现得更好,在预测功能限制比目前的渗流模型。

英文摘要:

We introduce a model of percolation induced by disorder, where an initially homogeneous network with links of equal weight is disordered by the introduction of heterogeneous weights for the links. We consider a pair of nodes i and j to be mutually reachable when the ratio α_{ij} of length of the optimal path between them before and after the introduction of disorder does not increase beyond a tolerance ratio τ. These conditions reflect practical limitations of reachability better than the usual percolation model, which entirely disregards path length when defining connectivity and, therefore, communication. We find that this model leads to a first order phase transition in both 2-dimensional lattices and in Erdos-Renyi networks, and in the case of the latter, the size of the discontinuity implies that the transition is effectively catastrophic, with almost all system pairs undergoing the change from reachable to unreachable. Using the theory of optimal path lengths under disorder, we are able to predict the percolation threshold. For real networks subject to changes while in operation, this model should perform better in predicting functional limits than current percolation models.

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

↑