Session B3: Uncovering the Structure of Complex Networks
11:15 AM–2:15 PM, Monday, March 13, 2006
Baltimore Convention Center Room: Ballroom I
Sponsoring Unit:
GSNP
Chair: Albert-Laszlo Barabasi, University of Notre Dame
Abstract ID: BAPS.2006.MAR.B3.3
Abstract: B3.00003 : Uncovering the overlapping modules of complex networks
12:27 PM–1:03 PM
Preview Abstract
MathJax On | Off 
Abstract 
Author:
Tamas Vicsek
(Eotvos University)
Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of. A fundamental question of great current interest is how to interpret the global organisation of such networks as the coexistence of their structural sub-units (called modules, communities, clusters, etc) associated with more highly interconnected parts. Identifying these unknown building blocks (e.g., functionally related proteins, industrial sectors, groups of people) is crucial to the understanding of the structural and functional properties of networks. The existing deterministic methods used for large data sets find separated modules, while most of the actual networks are made of highly overlapping cohesive groups of nodes. Here we introduce an approach to analyse the main statistical features of the interwoven sets of overlapping communities making a much needed step towards the uncovering of the modular structure of complex systems. After defining a set of new characteristic quantities for their statistics, we apply an efficient technique to explore overlapping communities on a large scale. We find that overlaps are indeed very significant, and the distributions we introduce reveal novel universal features of networks. Our studies of collaboration, word association, and protein interaction graphs demonstrate that the web of modules has highly non-trivial correlations and specific scaling properties.
To cite this abstract, use the following reference: http://meetings.aps.org/link/BAPS.2006.MAR.B3.3