arXiv:2601.16427v3 Announce Type: replace-cross
Abstract: We study exact community recovery in sparse directed stochastic block models using neighborhood smoothing of connection-probability profiles....
By Behzad Aalipur, Yichen Qin
arXiv:2609.12445v1 Announce Type: cross
Abstract: Community detection in bipartite networks is a fundamental problem in modern data analysis, with applications in recommendation systems, biological n...
By Huan Qing
The paper introduces a degree‑corrected joint matrix factorization technique for detecting communities in multilayer networks. It uses a nonnegative symmetric matrix trifactorization that enforces disjoint, shared communities across layers while allowing each layer to have distinct connectivity patterns and node degrees. An efficient algorithm is presented and evaluated on a multilayer degree‑corrected stochastic block model, showing superior performance compared to existing methods.
By Alexandra Dache, Manon Rustin, Arnaud Vandaele, Nicolas Gillis
The paper introduces the Dual-Corrected Stochastic Block Model (DC²SBM), a generative framework for community detection in attributed networks that decouples node activity into independent topological and attribute correction factors. By incorporating these factors into link‑generation and attribute‑generation channels and adding a global scaling parameter, the model preserves computational efficiency while improving detection accuracy, especially when topological signals are weak. Experiments on synthetic and real datasets demonstrate that DC²SBM outperforms existing methods and that a single shared activity factor is insufficient when topology and attributes are decoupled.
By Zhenhai Chang, Shuo Wang, Yumeng Liu, Wei Liu
arXiv:2607. 05469v1 Announce Type: cross Abstract: Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks.
By Jingyun Zhang, Hao Peng, Jianxin Li, Angsheng Li, Philip S. Yu
arXiv:2608. 10845v1 Announce Type: cross Abstract: Spectral clustering methods for network data are commonly based on a few matrix representations, such as the adjacency matrix and the symmetric Laplacian.
By John Park, Ning Hao