Graph spectra as a systematic tool in computational biology

We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or duplication leave characteristic traces in the spectrum. This can suggest hypotheses about the evolution of a graph representing biological data. To this data, we analyze several biological networks in terms of rough qualitative data of their spectra.

💡 Research Summary

The paper introduces the eigenvalue spectrum of the (normalized) graph Laplacian as a systematic analytical tool for biological networks and demonstrates how spectral characteristics can be linked to underlying evolutionary processes. After a concise motivation highlighting the limitations of traditional node‑centric topological descriptors, the authors lay out the mathematical foundation: the Laplacian L = D – A and its normalized counterpart L̂ = I – D⁻¹ᐟ² A D⁻¹ᐟ², whose eigenvalues λ_i lie in the interval