Overlapping and nonoverlapping models

Abstract

Consider a directed network with $K_r$ row communities and $K_c$ column communities. Previous works found that modeling directed networks in which all nodes have overlapping property requires $K_r=K_c$ for identifiability. In this paper, we propose an overlapping and nonoverlapping model to study directed networks in which row nodes have overlapping property while column nodes do not. The proposed model is identifiable when $K_r\le K_c$. Meanwhile, we provide one identifiable model as extension of ONM to model directed networks with variation in node degree. Two spectral algorithms with theoretical guarantee on consistent estimations are designed to fit the models. A small scale of numerical studies are used to illustrate the algorithms.

References in corpus (8)

• Stochastic blockmodels and community structure in networks
• Fast community detection by SCORE
• Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
• Mixed Membership Estimation for Social Networks
• Overlapping Clustering Models, and One (class) SVM to Bind Them All
• A useful criterion on studying consistent estimation in community detection
• Directed mixed membership stochastic blockmodel
• Directed degree corrected mixed membership model and estimating community memberships in directed networks