Preferential attachment of communities: The same principle, but a higher level
- 1 February 2006
- journal article
- Published by IOP Publishing in Europhysics Letters
- Vol. 73 (3) , 478-484
- https://doi.org/10.1209/epl/i2005-10414-6
Abstract
The graph of communities is a network emerging above the level of individual nodes in the hierarchical organisation of a complex system. In this graph the nodes correspond to communities (highly interconnected subgraphs, also called modules or clusters), and the links refer to members shared by two communities. Our analysis indicates that the development of this modular structure is driven by preferential attachment, in complete analogy with the growth of the underlying network of nodes. We study how the links between communities are born in a growing co-authorship network, and introduce a simple model for the dynamics of overlapping communities.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Fast algorithm for detecting community structure in networksPhysical Review E, 2004
- Weighted Evolving Networks: Coupling Topology and Weight DynamicsPhysical Review Letters, 2004
- A method for finding communities of related genesProceedings of the National Academy of Sciences, 2004
- Defining and identifying communities in networksProceedings of the National Academy of Sciences, 2004
- Distance, dissimilarity index, and network community structurePhysical Review E, 2003
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Emergence of Scaling in Random NetworksScience, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Superparamagnetic Clustering of DataPhysical Review Letters, 1996