Generative models for local network community detection
arXiv:1804.04469 · doi:10.1103/PhysRevE.97.042316
Abstract
Local network community detection aims to find a single community in a large network, while inspecting only a small part of that network around a given seed node. This is much cheaper than finding all communities in a network. Most methods for local community detection are formulated as ad-hoc optimization problems. In this work, we instead start from a generative model for networks with community structure. By assuming that the network is uniform, we can approximate the structure of unobserved parts of the network to obtain a method for local community detection. We apply this local approximation technique to two variants of the stochastic block model. To our knowledge, this results in the first local community detection methods based on probabilistic models. Interestingly, in the limit, one of the proposed approximations corresponds to conductance, a popular metric in this field. Experiments on real and synthetic datasets show comparable or improved results compared to state-of-the-art local community detection algorithms.
References in corpus (16)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Community detection in graphs
- Uncovering the overlapping community structure of complex networks in nature and society
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Stochastic blockmodels and community structure in networks
- Overlapping Community Detection in Networks: the State of the Art and Comparative Study
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Detecting fuzzy community structures in complex networks with a Potts model
- Mixture models and exploratory analysis in networks
- An efficient and principled method for detecting communities in networks
- A Bayesian Approach to Network Modularity
- Model Selection for Degree-corrected Block Models
- Community detection in networks with unequal groups