Community detection for weighted bipartite networks
arXiv:2109.10319 · doi:10.1016/j.knosys.2023.110643
Abstract
The bipartite network appears in various areas, such as biology, sociology, physiology, and computer science. \cite{rohe2016co} proposed Stochastic co-Blockmodel (ScBM) as a tool for detecting community structure of binary bipartite graph data in network studies. However, ScBM completely ignores edge weight and is unable to explain the block structure of a weighted bipartite network. Here, to model a weighted bipartite network, we introduce a Bipartite Distribution-Free model by releasing ScBM's distribution restriction. We also build an extension of the proposed model by considering the variation of node degree. Our models do not require a specific distribution on generating elements of the adjacency matrix but only a block structure on the expected adjacency matrix. Spectral algorithms with theoretical guarantees on the consistent estimation of node labels are presented to identify communities. Our proposed methods are illustrated by simulated and empirical examples.
arXiv comment27pages
References in corpus (25)
- The structure and function of complex networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Community detection in graphs
- The architecture of complex weighted networks
- Comparing community structure identification
- Analysis of weighted networks
- Stochastic blockmodels and community structure in networks
- Community detection in complex networks using Extremal Optimization
- How to project a bipartite network?
- Mixed membership stochastic blockmodels
- User-friendly tail bounds for sums of random matrices
- Spectral clustering and the high-dimensional stochastic blockmodel
- A Comprehensive Survey on Community Detection with Deep Learning
- Consistency of spectral clustering in stochastic block models
- Fast community detection by SCORE
- Community detection in node-attributed social networks: a survey
- Learning Latent Block Structure in Weighted Networks
- Evaluating Local Community Methods in Networks
- Nonparametric weighted stochastic block models
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
- An Enhanced Multi-Objective Biogeography-Based Optimization for Overlapping Community Detection in Social Networks with Node Attributes
- Spectral Algorithms for Community Detection in Directed Networks
- Randomized spectral co-clustering for large-scale directed networks