Directed degree corrected mixed membership model and estimating community memberships in directed networks
This paper considers the problem of modeling and estimating community memberships of nodes in a directed network where every row (column) node is associated with a vector determining its membership in each row (column) community. To model such directed network, we propose directed degree corrected mixed membership (DiDCMM) model by considering degree heterogeneity. DiDCMM is identifiable under popular conditions for mixed membership network when considering degree heterogeneity. Based on the cone structure inherent in the normalized version of the left singular vectors and the simplex structure inherent in the right singular vectors of the population adjacency matrix, we build an efficient algorithm called DiMSC to infer the community membership vectors for both row nodes and column nodes. By taking the advantage of DiMSC's equivalence algorithm which returns same estimations as DiMSC and the recent development on row-wise singular vector deviation, we show that the proposed algorithm is asymptotically consistent under mild conditions by providing error bounds for the inferred membership vectors of each row node and each column node under DiDCMM. The theory is supplemented by a simulation study.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Estimating Mixed-Memberships Using the Symmetric Laplacian Inverse Matrix
Mixed membership community detection is a challenging problem. In this paper, to detect mixed memberships, we propose a new method Mixed-SLIM which is a spectral clustering method on the symmetrized Laplacian inverse mat…
ClusteringCommunity DetectionConsistency of regularized spectral clustering in degree-corrected mixed membership model
Community detection in network analysis is an attractive research area recently. Here, under the degree-corrected mixed membership (DCMM) model, we propose an efficient approach called mixed regularized spectral clusteri…
ClusteringCommunity DetectionSIMPLE: Statistical Inference on Membership Profiles in Large Networks
Network data is prevalent in many contemporary big data applications in which a common interest is to unveil important latent links between different pairs of nodes. Yet a simple fundamental question of how to precisely …
Directed mixed membership stochastic blockmodel
Mixed membership problem for undirected network has been well studied in network analysis recent years. However, the more general case of mixed membership for directed network in which nodes can belong to multiple commun…
DCMM-Transformer: Degree-Corrected Mixed-Membership Attention for Medical Imaging
Medical images exhibit latent anatomical groupings, such as organs, tissues, and pathological regions, that standard Vision Transformers (ViTs) fail to exploit. While recent work like SBM-Transformer attempts to incorpor…