Research map / Learning theory and algorithms / Clustering
Bipartite Stochastic Block Models with Tiny Clusters
Stefan Neumann
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| pcv (SVD + k-means, then degree thresholding) instead of lim, message, lfm at low edge probability p<=0.3 | bipartite SBM cluster recovery · synthetic bipartite graphs, varying p | cluster quality Q (Jaccard) | Mixed |
| pcv instead of lim at high edge probability p>=0.5 | bipartite SBM cluster recovery · synthetic bipartite graphs, varying p | cluster quality Q (Jaccard) | Mixed |
| pcv instead of message, lim, lfm when right clusters are tiny (size 2-6) | bipartite SBM cluster recovery · synthetic, p=0.4, q=0.03, varying right-cluster size | right cluster quality Q | Improved |
| pcv instead of message, lim, lfm for left clusters | bipartite SBM cluster recovery · synthetic, varying right-cluster size | left cluster quality Q | Improved |
| pcv instead of message, lim, lfm in running time | bipartite SBM cluster recovery · synthetic graphs | running time | Improved |
| increase left cluster size l from 20 to 40 or more | pcv · synthetic, p=0.5, q=0.03 | right cluster quality Q | Improved |
Closest papers by meaning
- On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models (NeurIPS 2024 · similarity 0.88)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.87)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.87)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.87)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.86)
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
