arXiv Machine Learning
Directed mixed membership stochastic blockmodel
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 25
Simplify to Amplify: Achieving Information-Theoretic Bounds with Fewer Steps in Spectral Community Detection
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 Statistics ML
4d ago
Exact Community Recovery in Bipartite Networks
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...
arXiv Machine Learning
3d ago
Exact Recovery by Neighborhood Smoothing in Directed Stochastic Block Models
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....
arXiv AI
Jul 8
Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy
arXiv:2607. 05469v1 Announce Type: cross Abstract: Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks.
arXiv Machine Learning
Aug 19
Community Concealment from Graph Neural Networks
The paper introduces FCom‑DICE, a feature‑aware perturbation method that rewires influential edges and adjusts node features to hide a target community from graph neural network (GNN) inference. It shows that concealment effectiveness depends on boundary connectivity and feature similarity, and that FCom‑DICE outperforms structure‑only DICE on synthetic and real networks such as Facebook, Wikipedia, and Bitcoin Transactions while preserving key structural and feature properties.
arXiv Machine Learning
Aug 12
Spectral Embeddings of Degree-$\alpha$ Laplacians in Random Dot Product Graphs
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.