← Back to all news
arXiv Statistics ML September 14, 2026 By Huan Qing

Exact Community Recovery in Bipartite Networks

Read the original on arXiv Statistics ML →

The Flow has not summarised this story yet — read it at arXiv Statistics ML.

  • efficiency

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

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....

By Behzad Aalipur, Yichen Qin
efficiency
More like this →
arXiv Machine Learning
Sep 10

Directed mixed membership stochastic blockmodel

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
efficiency
More like this →
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.

By Sie Hendrata Dharmawan, Peter Chin
More like this →
arXiv Machine Learning
Jun 9

Alcmean's: Unsupervised community detection using local Laplacian, automatic detection of the number of centers

arXiv:2606. 09100v1 Announce Type: cross Abstract: Community detection is a fundamental problem in the analysis of complex networks.

By Shahin Momenzadeh, Rojiar Pir Mohammadiani
ragbenchmarks
More like this →
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.

By John Park, Ning Hao
rag
More like this →
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.

By Jingyun Zhang, Hao Peng, Jianxin Li, Angsheng Li, Philip S. Yu
benchmarks
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea