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.

4 pages, 2 figures

References in corpus (14)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Community structure in social and biological networks
• Modularity and community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Functional cartography of complex metabolic networks
• Evolution of networks
• Self-similarity of complex networks
• Detecting fuzzy community structures in complex networks with a Potts model
• Detecting Network Communities: a new systematic and efficient algorithm
• Detecting communities in large networks
• Skeleton and fractal scaling in complex networks
• Ring structures and mean first passage time in networks

Cited by in corpus (53)

• Community detection in graphs
• Vital nodes identification in complex networks
• Mathematical Formulation of Multi-Layer Networks
• Extracting the multiscale backbone of complex weighted networks
• Random walks and diffusion on networks
• Random Walks on Multiplex Networks
• Centrality in Interconnected Multilayer Networks
• Functional modularity of background activities in normal and epileptic brain networks
• Topological strata of weighted complex networks
• Maximal-entropy random walks in complex networks with limited information
• Efficiency of attack strategies on complex model and real-world networks
• Random walk centrality in interconnected multilayer networks
• Multiscale unfolding of real networks by geometric renormalization
• Information filtering in complex weighted networks
• Spectral Coarse Graining and Synchronization in Oscillator Networks
• Laplacian Renormalization Group for heterogeneous networks
• Coarse graining of master equations with fast and slow states
• Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature
• Enhancing transport properties in interconnected systems without altering their structure
• Complex networks: new trends for the analysis of brain connectivity
• Coarse Graining for Synchronization in Directed Networks
• Threefold way to the dimension reduction of dynamics on networks: an application to synchronization
• Dimensional Reduction of Markov State Models from Renormalization Group Theory
• Robustness of skeletons and salient features in networks
• Irreducible network backbones: unbiased graph filtering via maximum entropy
• Interplay between $k$-core and community structure in complex networks
• Statistically consistent coarse-grained simulations for critical phenomena in complex networks
• A unified data representation theory for network visualization, ordering and coarse-graining
• The characteristics of cycle-nodes-ratio and its application to network classification
• Non-parametric resampling of random walks for spectral network clustering
• Information-driven transitions in projections of underdamped dynamics
• Network Renormalization
• Multiscale network renormalization: scale-invariance without geometry
• Networks with many structural scales: a Renormalization Group perspective
• Phase-Space Networks of Geometrical Frustrated Systems
• Measuring nodes centrality when local and global measures overlap
• Finite-size scaling of geometric renormalization flows in complex networks
• Spectral coarse graining for random walk in bipartite networks
• Random walks in directed modular networks
• Detecting groups of similar components in complex networks
• Dynamics on Spatial Networks and the Effect of Distance Coarse Graining
• An ensemble perspective on multi-layer networks
• Topological estimation of the latent geometry of a complex network
• Entrograms and coarse graining of dynamics on complex networks
• Structural transition in interdependent networks with regular interconnections
• A subset selection based approach to finding important structure of complex networks
• A Graph Downsampling Technique Based On Graph Fourier Transform
• Kinetic network in Milestoning: Clustering, reduction, and transition path analysis
• Hierarchical Coarse-grained Approach to the Duration-dependent Spreading Dynamics in Complex Networks
• Inhomogeneous random graphs with infinite-mean fitness variables
• A hybrid multiscale coarse-grained method for dynamics on complex networks
• Accelerating the identification of informative reduced representations of proteins with deep learning for graphs
• Ageing related states of complex network formation in areca nuts