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

具有冗余依赖的单层网络的增强鲁棒性

Enhanced robustness of single-layer networks with redundant dependencies

Gábor Timár, György Kovács, José Fernando F. Mendes

摘要:

单层网络中的依赖链路提供了一种方便的方法来模拟网络系统中的非局部渗透效应,其中某些节点对只能一起工作。我们研究了该模型的弱变体的渗流性质:如果至少有一个依赖邻居是活跃的,则具有依赖邻居的节点可以继续发挥作用。我们表明,这种放松的依赖规则允许更强大的结构和丰富多样的临界现象,因为渗流并不严格由有限的依赖集群。我们研究Erdös-Rényi和随机无标度网络与一个底层的依赖链接的Erdös-Rényi网络。我们确定了一个特殊的“尖点”以上的系统总是稳定的,无论密度的依赖链接。我们发现连续和不连续的混合渗流过渡,分离的三临界点的Erdös-Rényi网络。对于有限度截断的无标度网络,我们观察到在一定的度分布指数范围内出现临界点和相应的双重跃迁。我们证明了在参数空间中的一个特殊点,即临界点出现的地方,巨可行团簇具有不寻常的临界奇点$S-S_c \propto (p-p_c)^{1/4}$。我们研究了连接度和依赖度相关的网络的鲁棒性,发现无标度网络能够保持足够强的正相关性,即,当集线器被更大的冗余保护时。

英文摘要:

Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak variant of this model: nodes with dependency neighbours may continue to function if at least one of their dependency neighbours is active. We show that this relaxation of the dependency rule allows for more robust structures and a rich variety of critical phenomena, as percolation is not determined strictly by finite dependency clusters. We study Erdös-Rényi and random scale-free networks with an underlying Erdös-Rényi network of dependency links. We identify a special "cusp" point above which the system is always stable, irrespective of the density of dependency links. We find continuous and discontinuous hybrid percolation transitions, separated by a tricritical point for Erdös-Rényi networks. For scale-free networks with a finite degree cutoff we observe the appearance of a critical point and corresponding double transitions in a certain range of the degree distribution exponent. We show that at a special point in the parameter space, where the critical point emerges, the giant viable cluster has the unusual critical singularity $S-S_c \propto (p-p_c)^{1/4}$. We study the robustness of networks where connectivity degrees and dependency degrees are correlated and find that scale-free networks are able to retain their high resilience for strong enough positive correlation, i.e., when hubs are protected by greater redundancy.

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

↑