arXiv · 0706.0812
Spectral coarse-graining of complex networks
Abstract
Reducing the complexity of large systems described as complex networks is key to understand 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 to approximate large networks by smaller ones, keeping most of their relevant spectral properties.
Explore related subjects
Keep this discovery
David Gfeller, Paolo De los Rios. 2007-06-06. Spectral coarse-graining of complex networks. https://doi.org/10.1103/physrevlett.99.038701
Cite the original work for its findings. Save a collection to share your selection of sources.