Intrinsic degree-correlations in static model of scale-free networks

Abstract

We calculate the mean neighboring degree function ${\bar{k}}_{\mathrm{nn}}(k)$ and the mean clustering function $C(k)$ of vertices with degree $k$ as a function of $k$ in finite scale-free random networks through the static model. While both are independent of $k$ when the degree exponent $\gamma \ge 3$, they show the crossover behavior for $2<\gamma <3$ from $k$-independent behavior for small $k$ to $k$-dependent behavior for large $k$. The $k$-dependent behavior is analytically derived. Such a behavior arises from the prevention of self-loops and multiple edges between each pair of vertices. The analytic results are confirmed by numerical simulations. We also compare our results with those obtained from a growing network model, finding that they behave differently from each other.

arXiv comment8 pages

References in corpus (21)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Assortative mixing in networks
• Hierarchical organization of modularity in metabolic networks
• Evolution of networks
• Specificity and stability in topology of protein networks
• Mean-field theory for scale-free random networks
• Hierarchical Organization in Complex Networks
• Dynamical and correlation properties of the Internet
• Universal Behavior of Load Distribution in Scale-free Networks
• Generation of uncorrelated random scale-free networks
• Large-scale topological and dynamical properties of Internet
• Class of correlated random networks with hidden variables
• Cut-offs and finite size effects in scale-free networks
• A General Formalism for Inhomogeneous Random Graphs
• The origin of degree correlations in the Internet and other networks
• Structural transitions in scale-free networks
• Rate equation approach for correlations in growing network models
• Evolution of scale-free random graphs: Potts model formulation
• Analytic solution of a static scale-free network model

Cited by in corpus (27)

• Critical phenomena in complex networks
• Emergence of bimodality in controlling complex networks
• Percolation on correlated networks
• Kuramoto model with frequency-degree correlations on complex networks
• Simplicial SIS model in scale-free uniform hypergraph
• Ensemble averageability in network spectra
• Statistical properties of sampled networks by random walks
• Inducing Effect on the Percolation Transition in Complex Networks
• Extensive load in multitasking associative networks
• Generation of arbitrarily two-point correlated random networks
• Generalization of core percolation on complex networks
• Effective epidemic containment strategy in hypergraphs
• Controllability and maximum matchings of complex networks
• Bridges in Complex Networks
• Scaling of nestedness in complex networks
• Percolation and Loop Statistics in Complex Networks
• Enhanced storage capacity with errors in scale-free Hopfield neural networks: an analytical study
• Random field Ising model on networks with inhomogeneous connections
• Uncovering hidden dependency in weighted networks via information entropy
• Characterizing the intrinsic correlations of scale-free networks
• Finite-size scaling of percolation on scale-free networks
• Degree distributions under general node removal: Power-law or Poisson?
• Relevance of the minimum degree to dynamic fluctuation in strongly heterogeneous networks
• A local algorithm and its percolation analysis of bipartite $z$-matching problem
• Discontinuous emergence of a giant cluster in assortative scale-free networks
• Spectral densities of scale-free networks
• Ground state energy of $q$-state Potts model: the minimum modularity