Community detection with nodal information

Abstract

Community detection is one of the fundamental problems in the study of network data. Most existing community detection approaches only consider edge information as inputs, and the output could be suboptimal when nodal information is available. In such cases, it is desirable to leverage nodal information for the improvement of community detection accuracy. Towards this goal, we propose a flexible network model incorporating nodal information, and develop likelihood-based inference methods. For the proposed methods, we establish favorable asymptotic properties as well as efficient algorithms for computation. Numerical experiments show the effectiveness of our methods in utilizing nodal information across a variety of simulated and real network data sets.

53 pages

References in corpus (5)

• Modularity and community structure in networks
• Stochastic blockmodels and community structure in networks
• Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms
• Detecting Overlapping Communities in Networks Using Spectral Methods
• Spectral Clustering of Graphs with the Bethe Hessian