Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function
arXiv:1607.08812 · doi:10.1063/1.4976015
Abstract
We study a Gaussian matrix function of the adjacency matrix of artificial and real-world networks. In particular, we study the Gaussian Estrada index---an index characterizing the importance of eigenvalues close to zero. This index accounts for the information contained in the eigenvalues close to zero in the spectra of networks. Here we obtain bounds for this index in simple graphs, proving that it reaches its maximum for star graphs followed by complete bipartite graphs. We also obtain formulas for the Estrada Gaussian index of Erdős-Rényi random graphs as well as for the Barabási-Albert graphs. We also show that in real-world networks this index is related to the existence of important structural patterns, such as complete bipartite subgraphs (bicliques). Such bicliques appear naturally in many real-world networks as a consequence of the evolutionary processes giving rise to them. In general, the Gaussian matrix function of the adjacency matrix of networks characterizes important structural information not described in previously used matrix functions of graphs.
arXiv comment22 pages, 4 figures
References in corpus (16)
- Emergence of scaling in random networks
- Assortative mixing in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Subgraph Centrality in Complex Networks
- Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
- Communicability in complex networks
- Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
- Software systems as complex networks: structure, function, and evolvability of software collaboration graphs
- The Physics of Communicability in Complex Networks
- Entanglement Percolation in Quantum Networks
- Spectral entropies as information-theoretic tools for complex network comparison
- Quantum complex networks
- Communicability Betweenness in Complex Networks
- On the limiting behavior of parameter-dependent network centrality measures
- Entanglement percolation in quantum complex networks
- Community Detection in Quantum Complex Networks