Hierarchical and mixing properties of static complex networks emerging from the fluctuating classical random graphs

Abstract

The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to lead to a static complex network with an arbitrary connectivity distribution. In particular, a scale-free network with the hierarchical organization is constructed without assuming any knowledge about the global linking structure, in contrast to the preferential attachment rule for a growing network. The hierarchical and mixing properties of the static scale-free network thus constructed are studied. The present approach establishes a bridge between a scalar characterization of individual vertices and topology of an emerging complex network. The result may offer a clue for understanding the origin of a few abundance of connectivity distributions in a wide variety of static real-world networks.

15 pages and 3 figures

References in corpus (8)

• Statistical mechanics of complex networks
• Assortative mixing in networks
• Hierarchical Organization in Complex Networks
• Dynamical and correlation properties of the Internet
• Universal Behavior of Load Distribution in Scale-free Networks
• A General Formalism for Inhomogeneous Random Graphs
• Nonextensive statistical mechanics and complex scale-free networks
• Nonextensive aspects of small-world networks

Cited by in corpus (4)

• Generalized entropies and the transformation group of superstatistics
• Superstatistics, thermodynamics, and fluctuations
• Fluctuations of entropy and log-normal superstatistics
• Clustering Coefficients of Protein-Protein Interaction Networks