Laplacian Spectrum and Protein-Protein Interaction Networks
arXiv:0705.3373
Abstract
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.
7 pages, 3 figures
References in corpus (6)
- Emergence of scaling in random networks
- Lethality and centrality in protein networks
- Spectral Properties and Synchronization in Coupled Map Lattices
- Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network
- Duplication-divergence model of protein interaction network
- Evolutionary reconstruction of networks
Cited by in corpus (6)
- Spectral plots and the representation and interpretation of biological data
- Spectral distances on graphs
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication
- Phylogeny of Metabolic Networks: A Spectral Graph Theoretical Approach
- Graph spectra as a systematic tool in computational biology
- Interaction patterns in diabetes mellitus II network: An RMT relation