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.
By Sie Hendrata Dharmawan, Peter Chin
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...
By Huan Qing, Jingli Wang
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
arXiv:2606. 01546v1 Announce Type: new Abstract: Sparse high-dimensional representations are conducive to uncovering nontrivial structures in unsupervised exploration of data.
By Shagesh Sridharan, Yanis Bahroun, Anirvan M. Sengupta
The paper introduces DISCO, a deep‑learning framework for detecting overlapping communities in networks. DISCO integrates a diffusion‑based structural prior, sparse multi‑head attention, and a Bernoulli‑Poisson edge‑reconstruction objective to infer community affiliations from node attributes and structural profiles. Experiments show competitive performance against existing graph convolutional and attention methods, and a cybersecurity proof‑of‑concept demonstrates how community changes can signal anomalies in dynamic communication networks.
By Kosti Koistinen, Vesa Kuikka, Joni Herttuainen, Matthew Hendren, Brian Holt, Kimmo K. Kaski
arXiv:2608. 03696v1 Announce Type: new Abstract: This work focuses on the problem of learning on temporal graphs, with particular emphasis on the task of clustering: obtaining coarse-grained representations by aggregating information from nodes, edges, and temporal dynamics - a task related to pooling in machine learning on graphs, or community detection in network science.
By Nelson Aloysio Reis de Almeida Passos, Emanuele Carlini, Salvatore Trani