ویراساینس.
سند علمی

Width of percolation transition in complex networks.

Tomer Kalisky, Reuven Cohen

چکیده

It is known that the critical probability for the percolation transition is not a sharp threshold. Actually it is a region of nonzero width Deltap(c) for systems of finite size. Here we present evidence that for complex networks Deltap(c) approximately p(c)/l, where l approximately Nnu(opt), where is the average length of the percolation cluster, and N is the number of nodes in the network. For Erdos-Rényi graphs nu(opt)=1/3, while for scale-free networks with a degree distribution P(k) approximately k(-lambda) and 3<lambda<4, nu(opt)=(lambda-3)/(lambda-1) . We show analytically and numerically that the survivability S(p,l), which is the probability of a cluster to survive l chemical shells at probability p, behaves near criticality as S(p,l)=S(p(c),l)exp[(p-p(c))l/p(c)]. Thus for probabilities inside the region |p-p(c)|<p(c)/l the behavior of the system is indistinguishable from that of the critical point.

اسناد مشابه

  • Multiple Hybrid Phase Transition: Bootstrap Percolation on Complex Networks with Communities

    سند علمی۲۰۱۴Chong Wu, Shenggong Ji, Rui Zhang, Liujun Chen

    X iv :1 40 1. 46 80 v3 [ ph ys ic s. so cph ] 2 2 Ja n 20 14 Bootstrap Percolation on Complex Networks with Community Structure Chong Wu1, Shenggong Ji1, Rui Zhang1,2,3, Liujun Chen4,∗ Jiawei Chen4, Xiaobin Li1, and Yanqing Hu1† 1School of Mathematics, Southwest Jiaotong Universi

  • BOSTON UNIVERSITY GRADUATE SCHOOL OF ARTS AND SCIENCES Dissertation TRANSPORT AND PERCOLATION IN COMPLEX NETWORKS by

    سند علمی۲۰۱۲GUANLIANG LI

    Acknowledgments In the path for pursuing my Ph.D, there are many people supporting me, guiding me and helping me. Ph.D, all the years offering the financial support to me along the path to achieving it and teaching me to prepare excellent talks. I feel lucky in his research group

  • Core percolation on complex networks

    سند علمی۲۰۱۲Physical review lettersYang-Yu Liu, Endre Csóka, Haijun Zhou, Márton Pósfai

    We analytically solve the core percolation problem for complex networks with arbitrary degree distributions. We find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is continuous while

  • k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects

    سند علمی۲۰۰۶Physical review. E, Statistical, nonlinear, and soft matter physicsAlexander V. Goltsev, Sergey N. Dorogovtsev, Jose F. F. Mendes

    We develop the theory of the -core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the -core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core as at a first order phase transition but a

  • $k$-core percolation on complex networks: Comparing random, localized and targeted attacks

    سند علمی۲۰۱۶Physical review. EXin Yuan, Yang Dai, H. Eugene Stanley, Shlomo Havlin

    The type of malicious attack inflicting on networks greatly influences their stability under ordinary percolation in which a node fails when it becomes disconnected from the giant component. Here we study its generalization, k-core percolation, in which a node fails when it loses

  • Percolation on complex networks: Theory and application

    مقاله‌ی دسترسی آزاد۲۰۲۱Physics Reports['Ming Li', 'Run-Ran Liu', 'Linyuan Lü', 'Mao-Bin Hu', 'Shuqi Xu', 'Yi-Cheng Zhang', '']

    In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology sociology, from perspective of heterogeneous interaction patterns components composing complex systems. As a paradigm for random semi-rando