Analytic solution of a static scale-free network model

Abstract

We present a detailed analytical study of a paradigmatic scale-free network model, the Static Model. Analytical expressions for its main properties are derived by using the hidden variables formalism. We map the model into a canonic hidden variables one, and solve the latter. The good agreement between our predictions and extensive simulations of the original model suggests that the mapping is exact in the infinite network size limit. One of the most remarkable findings of this study is the presence of relevant disassortative correlations, which are induced by the physical condition of absence of self and multiple connections.

8 pages, 4 figures

References in corpus (22)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Assortative mixing in networks
• The large-scale organization of metabolic networks
• Evolution of networks
• Network robustness and fragility: Percolation on random graphs
• Evolution of the social network of scientific collaborations
• Dynamical and correlation properties of the Internet
• Breakdown of the Internet under intentional attack
• The Web of Human Sexual Contacts
• Universal Behavior of Load Distribution in Scale-free Networks
• Organization of Growing Random Networks
• Generation of uncorrelated random scale-free networks
• Betweenness Centrality in Large Complex Networks
• Class of correlated random networks with hidden variables
• Cut-offs and finite size effects in scale-free networks
• Sandpile on Scale-Free Networks
• A General Formalism for Inhomogeneous Random Graphs
• Evolution of scale-free random graphs: Potts model formulation
• Comment on: 'Universal Behavior of Load Distribution in Scale-free Networks'

Cited by in corpus (29)

• Percolation on complex networks: Theory and application
• Core percolation on complex networks
• Cascades in multiplex financial networks with debts of different seniority
• Inducing Effect on the Percolation Transition in Complex Networks
• Generalization of core percolation on complex networks
• Statistical Mechanics of the Minimum Dominating Set Problem
• Intrinsic degree-correlations in static model of scale-free networks
• Controllability and maximum matchings of complex networks
• Interplay between network structure and self-organized criticality
• Exotic Critical Behavior of Weak Multiplex Percolation
• Bridges in Complex Networks
• Organization of complex networks without multiple connections
• Trend-driven information cascades on random networks
• Core organization of directed complex networks
• Optimizing target nodes selection for the control energy of directed complex networks
• Fluctuations analysis in complex networks modeled by hidden variable models. Necessity of a large cut-off in hidden-variable models
• Diversity of structural controllability of complex networks with given degree sequence
• Critical behavior and correlations on scale-free small-world networks. Application to network design
• Incorporating Heterogeneous Interactions for Ecological Biodiversity
• Statistical mechanics of random geometric graphs: Geometry-induced first order phase transition
• Impact of noise and damage on collective dynamics of scale-free neuronal networks
• Random node reinforcement and $K$-core structure of complex networks
• Two faces of greedy leaf removal procedure on graphs
• Generalized $k$-core pruning process on directed networks
• Fluctuations of motifs and non self-averaging in complex networks. A self- vs non-self-averaging phase transition scenario
• Scale-free tree network with an ultra-large diameter
• Critical phenomena on heterogeneous small-world networks
• A local algorithm and its percolation analysis of bipartite $z$-matching problem
• Optimal Disruption of Complex Networks