Origin and implications of zero degeneracy in networks spectra.

  title={Origin and implications of zero degeneracy in networks spectra.},
  author={Alok Yadav and Sarika Jalan},
  volume={25 4},
The spectra of many real world networks exhibit properties which are different from those of random networks generated using various models. One such property is the existence of a very high degeneracy at the zero eigenvalue. In this work, we provide all the possible reasons behind the occurrence of the zero degeneracy in the network spectra, namely, the complete and partial duplications, as well as their implications. The power-law degree sequence and the preferential attachment are the… 

Figures and Tables from this paper

Spectral properties of complex networks.
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three
Null-eigenvalue localization of quantum walks on complex networks
The adjacency matrices of real-world complex networks systematically have null eigenspaces with much higher dimensions than that of random networks, caused by duplication mechanisms leading to structures with local symmetries which should be more present in complex organizations.
so cph ] 1 O ct 2 01 8 Spectra of networks
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far, and discusses spectral characteristics of real-world networks, with particular emphasis on their extent of similarities and differences.
Randomness and Structure in Collaboration Networks: A Random Matrix Analysis
It is propagated that a blend of directional advancement and the mixing of schools of thoughts is essential for the steady development of a particular field of research.
The role of symmetry in neural networks and their Laplacian spectra
On the second largest eigenvalue of networks
From predicting the epidemic threshold of a disease outbreak to anticipating the stability of a complex system, analysis of spectra of the adjacency matrices of the underlying networks play a pivotal
Random matrix analysis of multiplex networks
Interplay of degree correlations and cluster synchronization.
The role of degree-degree correlation in the networks' cluster synchronizability is investigated and degeneracy at the zero eigenvalues provides an understanding of the occurrence of the driven phenomenon behind the synchronization in disassortative networks.
The 3-cycle weighted spectral distribution in evolving community-based networks.
The 3-cycle weighted spectral distribution defined as the weighted sum of the normalized Laplacian spectral distribution with a scaling factor n is demonstrated to be asymptotically independent of the network size and strictly represents the triangle relationships between low-degree nodes.


Spectra of complex networks.
It is shown that spectra of locally treelike random graphs may serve as a starting point in the analysis of spectral properties of real-world networks, e.g., of the Internet.
Eigenvalue spectra of modular networks.
This work obtains in a unified fashion the spectrum of a large family of operators, including the adjacency, Laplacian, and normalized LaPLacian matrices, for networks with generic modular structure, in the limit of large degrees.
Spectral analysis and the dynamic response of complex networks.
It is shown that the spectral density of hierarchical networks follows a very different pattern, which can be used as a fingerprint of modularity, related to the homeostatic response of the network.
Statistical mechanics of complex networks
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Graph spectra and the detectability of community structure in networks
Using methods from random matrix theory, the spectra of networks that display community structure are calculated, and it is shown that spectral modularity maximization is an optimal detection method in the sense that no other method will succeed in the regime where the modularity method fails.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Measures of degeneracy and redundancy in biological networks.
Functional measures of the degeneracy and redundancy of a system with respect to a set of outputs are developed and promise to be useful in characterizing and understanding the functional robustness and adaptability of biological networks.
Random graphs with arbitrary degree distributions and their applications.
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
Graph Spectra for Complex Networks
This self-contained book provides a concise introduction to the theory of graph spectra and its applications to the study of complex networks, and the general properties of both the adjacency and Laplacian spectrum of graphs are derived and applied to complex networks.