Spectral Coarse Graining of Complex Networks

David Gfeller and Paolo De Los Rios
Phys. Rev. Lett. 99, 038701 – Published 19 July 2007

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.

  • Figure
  • Figure
  • Received 26 February 2007

DOI:https://doi.org/10.1103/PhysRevLett.99.038701

©2007 American Physical Society

Authors & Affiliations

David Gfeller and Paolo De Los Rios

  • Laboratoire de Biophysique Statistique, SB/ITP, Ecole Polytechnique Fédérale de Lausanne (EPFL), CH-1015, Lausanne, Switzerland

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 99, Iss. 3 — 20 July 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×