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...
The paper investigates clustering of multi‑layer networks generated under a mixture multi‑layer stochastic block model (MMSBM). It derives the minimax optimal clustering error rate, expressed via Chernoff information between component edge‑probability distributions, and introduces a two‑stage estimator that achieves this rate even under extreme sparsity. The method is extended to count‑weighted networks using a mixture multi‑layer Poisson block model, with numerical experiments and real‑data analyses demonstrating its practical performance.
arXiv:2101.02307v4 Announce Type: replace-cross Abstract: Mixed membership modeling for undirected networks has been extensively explored in network science over the past few years. Despite the subst...
The paper introduces T-ARC, a clustering algorithm that integrates topological information into the K‑means objective by coupling a data‑fidelity term with a graph‑cut penalty. The latent graph is modeled as a random realization from a Stochastic Block Model, whose parameter is optimized via Distributionally Robust Optimization, using a persistence‑based similarity matrix derived from zero‑dimensional persistent homology. Experiments on synthetic non‑convex data and Fashion‑MNIST subsets demonstrate that T‑ARC recovers latent topological structures and outperforms K‑means on curved and interleaved clusters while remaining competitive and more stable on real data.
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.
arXiv:2610.18937v1 Announce Type: cross Abstract: Network-linked data combine a network with covariates and responses observed for its nodes. Common regression approaches either model dependence amon...
arXiv:2411.02835v3 Announce Type: replace-cross Abstract: The Bethe-Hessian matrix, introduced by Saade, Krzakala, and Zdeborov\'a (2014), is a Hermitian matrix designed for applying spectral cluster...
arXiv:2602. 17104v2 Announce Type: replace-cross Abstract: We propose a streamlined spectral algorithm for community detection in the two-community stochastic block model (SBM) under constant edge density assumptions.
arXiv:2606. 02055v1 Announce Type: cross Abstract: We study exact community recovery in the two-community stochastic block model on $n$ vertices under limited and noisy access to network data.
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.
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.
arXiv:2610. 08872v1 Announce Type: cross Abstract: We study community recovery in the sparse symmetric stochastic block model with $q$ communities, average degree $d$ and signal strength $\lambda$ through statistical decision theory and Fisher information, and obtain three characterizations of the Kesten-Stigum threshold $d\lambda^2=1$ and of the information-computation gap below it.