Metraipolis › archive › dc_6f620c406eb7

Exact Community Recovery in Bipartite Networks — arXiv:2609.12445

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12445
License (as archived)
CC0-1.0
Archived
2026-10-16T03:12:12.475Z
SHA-256 of the archived text
98a0bbb7df1b2cc44e92d168c72fec832009d98a6f6d7ab5be8ae214721a40da
Stable URL of this page
https://metraipolis.com/documento/dc_6f620c406eb7

How to cite

Exact Community Recovery in Bipartite Networks — arXiv:2609.12445 — arXiv (en), https://arxiv.org/abs/2609.12445 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6f620c406eb7 (Metraipolis archive dc_6f620c406eb7, sha256 98a0bbb7df1b2cc44e92d168c72fec832009d98a6f6d7ab5be8ae214721a40da)
BibTeX
@misc{dc6f620c406eb7,
  title = {Exact Community Recovery in Bipartite Networks — arXiv:2609.12445},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12445},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6f620c406eb7; sha256 98a0bbb7df1b2cc44e92d168c72fec832009d98a6f6d7ab5be8ae214721a40da},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12445. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Community detection in bipartite networks is a fundamental problem in modern data analysis, with applications in recommendation systems, biological networks, and social network analysis. Unlike conventional unipartite graphs, bipartite networks consist of two distinct types of nodes with edges only connecting across types, so recovering latent communities requires estimating labels on the two node types. The stochastic co-blockmodel is a classical probabilistic framework for such networks, yet theoretical guarantees for exact community recovery in this setting remain limited, especially when the number of communities grows, the community sizes are unbalanced, or the degrees are heterogeneous. In this work, we prove that a simple spectral clustering algorithm based on the diagonal-deleted Gram matrix achieves exact recovery with high probability under mild conditions on sparsity, community balance, and the number of clusters. We further extend the result to the degree-corrected stochastic co-blockmodel, where each node carries its own degree heterogeneity parameter, and show that a row-normalized version of the same algorithm maintains the exact recovery guarantee. Extensive experiments validate our theoretical findings.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-14 in cs.SI).
Categorie arXiv: Social and Information Networks (cs.SI) ; Statistics Theory (math.ST); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.12445 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T03:04:52.392Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).