A General Definition of Network Communities and the Corresponding Detection Algorithm
arXiv:1801.07783 · doi:10.3390/fi11020041
Abstract
Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media companies) need community structures to allocate network resources and provide proper and accurate services. However, all the current detection algorithms are motivated by the practical problems, whose applicabilities in other fields are open to question. Thence, for a new community problem, researchers need to derive algorithms ad hoc, which is arduous and even unnecessary. In this paper, we represent a general procedure to find community structures in practice. We mainly focus on two typical types of networks: transmission networks and similarity networks. We reduce them to a unified graph model, based on which we propose a general method to define and detect communities. Readers can specialize our general algorithm to accommodate their problems. In the end, we also give a demonstration to show how the algorithm works.
References in corpus (20)
- Community detection in graphs
- Fast algorithm for detecting community structure in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Comparing community structure identification
- Link communities reveal multiscale complexity in networks
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Higher-order organization of complex networks
- CFinder: Locating cliques and overlapping modules in biological networks
- Synchronization reveals topological scales in complex networks
- Finding overlapping communities in networks by label propagation
- Mixed membership stochastic blockmodels
- Detecting fuzzy community structures in complex networks with a Potts model
- The ground truth about metadata and community detection in networks
- Community detection in networks: Modularity optimization and maximum likelihood are equivalent
- Community Detection via Maximization of Modularity and Its Variants
- Detecting highly overlapping community structure by greedy clique expansion
- Social significance of community structure: Statistical view
- Synchronization interfaces and overlapping communities in complex networks
- The -model for Random Graphs --- Regression, Cramér-Rao Bounds, and Hypothesis Testing