pith. sign in

arxiv: cond-mat/0601579 · v1 · submitted 2006-01-25 · ❄️ cond-mat.stat-mech

Preferential attachment of communities: the same principle, but a higher level

classification ❄️ cond-mat.stat-mech
keywords communitiesnetworknodesattachmentgraphlevellinkspreferential
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.