Spectral Coarse Graining of Complex Networks
- 19 July 2007
- journal article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 99 (3) , 038701
- https://doi.org/10.1103/physrevlett.99.038701
Abstract
Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining scheme for complex networks. By construction the coarse graining preserves the slow modes of the walk, while reducing significantly the size and the complexity of the network. In this sense our coarse graining allows us to approximate large networks by smaller ones, keeping most of their relevant spectral properties.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Complex network analysis of free-energy landscapesProceedings of the National Academy of Sciences, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005
- Functional cartography of complex metabolic networksNature, 2005
- Detecting Fuzzy Community Structures in Complex Networks with a Potts ModelPhysical Review Letters, 2004
- Detecting network communities: a new systematic and efficient algorithmJournal of Statistical Mechanics: Theory and Experiment, 2004
- The Protein Folding NetworkJournal of Molecular Biology, 2004
- An efficient algorithm for large-scale detection of protein familiesNucleic Acids Research, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002