Laplacian Spectrum and Protein-Protein Interaction Networks

From the spectral plot of the (normalized) graph Laplacian, the essential qualitative properties of a network can be simultaneously deduced. Given a class of empirical networks, reconstruction schemes for elucidating the evolutionary dynamics leading to those particular data can then be developed. This method is exemplified for protein-protein interaction networks. Traces of their evolutionary history of duplication and divergence processes are identified. In particular, we can identify typical specific features that robustly distinguish protein-protein interaction networks from other classes of networks, in spite of possible statistical fluctuations of the underlying data.

💡 Research Summary

The paper introduces a novel framework for analyzing complex networks by exploiting the full spectrum of the normalized graph Laplacian. Unlike traditional network descriptors that focus on isolated metrics such as degree distribution or clustering coefficient, the Laplacian eigenvalue distribution encodes global connectivity, modularity, and randomness in a single continuous profile. The authors first compute the normalized Laplacian (L = I - D^{-1/2} A D^{-1/2}) for a variety of empirical protein‑protein interaction (PPI) networks drawn from yeast, human, and Drosophila datasets. By plotting the eigenvalues (which lie in the interval (