Different thresholds of bond percolation in scale-free networks with identical degree sequence

Abstract

Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that degree distribution is a key ingredient. The purpose of this paper is to show that power-law degree distribution itself is not sufficient to characterize the threshold of bond percolation in scale-free networks. To achieve this goal, we first propose a family of scale-free networks with the same degree sequence and obtain by analytical or numerical means several topological features of the networks. Then, by making use of the renormalization group technique we determine the threshold of bond percolation in our networks. We find an existence of non-zero thresholds and demonstrate that these thresholds can be quite different, which implies that power-law degree distribution does not suffice to characterize the percolation threshold in scale-free networks.

Definitive version published in Physical Review E

References in corpus (25)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• The spread of epidemic disease on networks
• Specificity and stability in topology of protein networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Critical phenomena in complex networks
• Breakdown of the Internet under intentional attack
• Epidemics and percolation in small-world networks
• Absence of epidemic threshold in scale-free networks with connectivity correlations
• A fast Monte Carlo algorithm for site or bond percolation
• Resilience to damage of graphs with degree correlations
• Fractal and Transfractal Recursive Scale-Free Nets
• Percolation and Epidemic Thresholds in Clustered Networks
• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• Geography in a Scale-Free Network Model
• Percolation in Hierarchical Scale-Free Nets
• Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
• Fractal scale-free networks resistant to disease spread
• Critical surfaces for general bond percolation problems
• Renormalization group for evolving networks
• Derivation of the percolation threshold for the network model of Barabasi and Albert
• Inhomogeneous percolation models for spreading phenomena in random graphs

Cited by in corpus (8)

• Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
• Counting spanning trees in self-similar networks by evaluating determinants
• Role of fractal dimension in random walks on scale-free networks
• An ensemble of random graphs with identical degree distribution
• Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence
• Maximum matchings in scale-free networks with identical degree distribution
• Constructions and properties of a class of random scale-free networks
• Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web