Criterions for locally dense subgraphs
arXiv:1103.3397 · doi:10.1016/j.physa.2011.09.040
Abstract
Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal cohesion, the latter being a new concept. I propose a local method of community detection based on two-dimensional local optimization, which I tested on common benchmarks and on the word association database.
Revised version. 26 pages, 8 figures, 1 table
References in corpus (32)
- Uncovering the overlapping community structure of complex networks in nature and society
- Cooperative Game Theory Approaches for Network Partitioning
- Maps of random walks on complex networks reveal community structure
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Critical phenomena in complex networks
- Community detection algorithms: a comparative analysis
- Hierarchical structure and the prediction of missing links in networks
- Statistical Mechanics of Community Detection
- Stochastic blockmodels and community structure in networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Finding statistically significant communities in networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- An information-theoretic framework for resolving community structure in complex networks
- Communicability in complex networks
- Line Graphs, Link Partitions and Overlapping Communities
- Mixture models and exploratory analysis in networks
- Extracting the hierarchical organization of complex systems
- Analysis of the structure of complex networks at different resolution levels
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Robustness of community structure in networks
- Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
- A Bayesian Approach to Network Modularity
- Characterizing the community structure of complex networks
- Community Detection as an Inference Problem
- Limited resolution in complex network community detection with Potts model approach
- Identifying network communities with a high resolution
- Communities and beyond: mesoscopic analysis of a large social network with complementary methods
- Thermodynamics of Community Structure
- Detecting groups of similar components in complex networks
- Random Walks on Complex Networks