Overlapping modularity at the critical point of k-clique percolation
arXiv:1308.3340 · doi:10.1007/s10955-012-0640-5
Abstract
One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social networks is a non-trivial task with great potential for practical applications, gaining a notable interest in the recent years. The Clique Percolation Method (CPM) is one of the earliest overlapping community finding methods, which was already used in the analysis of several different social networks. In this approach the communities correspond to k-clique percolation clusters, and the general heuristic for setting the parameters of the method is to tune the system just below the critical point of k-clique percolation. However, this rule is based on simple physical principles and its validity was never subject to quantitative analysis. Here we examine the quality of the partitioning in the vicinity of the critical point using recently introduced overlapping modularity measures. According to our results on real social- and other networks, the overlapping modularities show a maximum close to the critical point, justifying the original criteria for the optimal parameter settings.
arXiv comment20 pages, 6 figures
References in corpus (43)
- Emergence of scaling in random networks
- Fast unfolding of communities in large networks
- Statistical mechanics of complex networks
- Community structure in social and biological networks
- Community detection in graphs
- Uncovering the overlapping community structure of complex networks in nature and society
- The structure of scientific collaboration networks
- Hierarchical organization of modularity in metabolic networks
- Resolution limit in community detection
- Collective motion
- Hierarchical structure and the prediction of missing links in networks
- Evolution of the social network of scientific collaborations
- Link communities reveal multiscale complexity in networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Structure and tie strengths in mobile communication networks
- Quantifying social group evolution
- Self-similar community structure in organisations
- Self-similarity of complex networks
- Identity and Search in Social Networks
- CFinder: Locating cliques and overlapping modules in biological networks
- An information-theoretic framework for resolving community structure in complex networks
- Dynamics of market correlations: Taxonomy and portfolio analysis
- Detect overlapping and hierarchical community structure in networks
- Weighted evolving networks: coupling topology and weights dynamics
- Clique percolation in random networks
- Deterministic Scale-Free Networks
- Geographical dispersal of mobile communication networks
- Fuzzy communities and the concept of bridgeness in complex networks
- Extending the definition of modularity to directed graphs with overlapping communities
- Analysis of a large-scale weighted network of one-to-one human communication
- The Simultaneous Evolution of Author and Paper Networks
- Complexity: The bigger picture
- Self-organization of collaboration networks
- Multiresolution community detection for megascale networks by information-based replica correlations
- Modularity and Extreme Edges of the Internet
- Community structure and ethnic preferences in school friendship networks
- Folks in Folksonomies: Social Link Prediction from Shared Metadata
- Modularity measure of networks with overlapping communities
- Multifractal Network Generator
- Link creation and profile alignment in the aNobii social network
- The critical point of k-clique percolation in the Erdos-Renyi graph
- On scale-free and poly-scale behaviors of random hierarchical network
- Rotated multifractal network generator