| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418754 | Discrete Applied Mathematics | 2009 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Anirban Banerjee, Jürgen Jost,