Diffusion on Complex Networks : A way to probe their large scale topological structures
arXiv:cond-mat/0312476 · doi:10.1016/j.physa.2004.01.021
Abstract
A diffusion process on complex networks is introduced in order to uncover their large scale topological structures. This is achieved by focusing on the slowest decaying diffusive modes of the network. The proposed procedure is applied to real-world networks like a friendship network of known modular structure, and an Internet routing network. For the friendship network, its known structure is well reproduced. In case of the Internet, where the structure is far less well-known, one indeed finds a modular structure, and modules can roughly be associated with individual countries. Quantitatively the modular structure of the Internet manifests itself in an approximately 10 times larger participation ratio of its slowest decaying modes as compared to the null model -- a random scale-free network. The extreme edges of the Internet are found to correspond to Russian and US military sites.
Latex, 13 pages, 4 figures (To appear Physica A)
References in corpus (9)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Cooperative Game Theory Approaches for Network Partitioning
- Specificity and stability in topology of protein networks
- Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
- Spectra and eigenvectors of scale-free networks
- Modularity and Extreme Edges of the Internet
- Diffusion, localization and dispersion relations on ``small-world'' lattices
Cited by in corpus (26)
- Community detection in graphs
- Memory in network flows and its effects on spreading dynamics and community detection
- Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
- Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
- Identifying "communities" within energy landscapes
- Computing communities in large networks using random walks (long version)
- Computing communities in large networks using random walks
- Multiscale Analysis of Spreading in a Large Communication Network
- Mapping flows on hypergraphs
- Inversion method for content-based networks
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
- The linear noise approximation for reaction-diffusion systems on networks
- Diffusion in scale-free networks with annealed disorder
- Hopping in the crowd to unveil network topology
- Effects of city-size heterogeneity on epidemic spreading in a metapopulation: A reaction-diffusion approach
- Spectral methods and cluster structure in correlation-based networks
- Thermodynamic approach for community discovering within the complex networks: LiveJournal study
- Diffusion on hierarchical systems of weakly-coupled networks
- Eigenvector localization as a tool to study small communities in online social networks
- When are recommender systems useful?
- Flow-based Community Detection in Hypergraphs
- Network heterogeneity and node capacity lead to heterogeneous scaling of fluctuations in random walks on graphs
- A Systematic Survey on Multi-relational Community Detection
- Optimization of convergence rate via algebraic connectivity
- Cross-frequency interactions during diffusion on complex brain networks are facilitated by scale-free properties
- Spectral analysis for gene communities in cancer cells