Scaling Invariance in Spectra of Complex Networks: A Diffusion Factorial Moment Approach
arXiv:cond-mat/0509012 · doi:10.1103/PhysRevE.72.046119
Abstract
A new method called diffusion factorial moment (DFM) is used to obtain scaling features embedded in spectra of complex networks. For an Erdos-Renyi network with connecting probability , the scaling parameter is , while for the scaling parameter deviates from it significantly. For WS small-world networks, in the special region , typical scale invariance is found. For GRN networks, in the range of , we have . And the value of oscillates around abruptly. In the range of , we have basically . Scale invariance is one of the common features of the three kinds of networks, which can be employed as a global measurement of complex networks in a unified way.
6 pages, 8 figures. to appear in Physical Review E
References in corpus (9)
- The structure and function of complex networks
- Self-similarity of complex networks
- Spectra of complex networks
- Modularity and Extreme Edges of the Internet
- Networks in life: Scaling properties and eigenvalue spectra
- Temporal Series Analysis Approach to Spectra of Complex Networks
- Diffusion Entropy Approach to Dynamical Characteristics of a Hodgkin-Huxley Neuron
- Modeling SARS Spreading on Complex Networks
- Spectral properties and pattern selection in fractal growth networks
Cited by in corpus (12)
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Weighted Network of Chinese Nature Science Basic Research
- Localizations on Complex Networks
- Growing Scale-free Small-world Networks with Tunable Assortative Coefficient
- Diffusion entropy analysis on the scaling behavior of financial markets
- Collective Chaos Induced by Structures of Complex Networks
- Synchronizabilities of Networks: A New index
- Self-affine Fractals Embedded in Spectra of Complex Networks
- Eigenvector localization as a tool to study small communities in online social networks
- Optimal box-covering algorithm for fractal dimension of complex networks
- The scaling properties of dynamical fluctuations in temporal networks