TL;DR
This paper compares alternative models to the fixed degree sequence model for extracting significant edges in bipartite network projections, finding that the stochastic degree sequence model offers a practical and accurate approximation.
Contribution
It introduces and evaluates four alternative models to FDSM, recommending SDSM as a computationally efficient and accurate method for large bipartite network analysis.
Findings
SDSM closely approximates FDSM in accuracy and statistical properties.
SDSM correctly recovers known community structures even with weak signals.
SDSM is significantly faster than FDSM, enabling analysis of larger networks.
Abstract
Projections of bipartite or two-mode networks capture co-occurrences, and are used in diverse fields (e.g., ecology, economics, bibliometrics, politics) to represent unipartite networks. A key challenge in analyzing such networks is determining whether an observed number of co-occurrences between two nodes is significant, and therefore whether an edge exists between them. One approach, the fixed degree sequence model (FDSM), evaluates the significance of an edge's weight by comparison to a null model in which the degree sequences of the original bipartite network are fixed. Although the FDSM is an intuitive null model, it is computationally expensive because it requires Monte Carlo simulation to estimate each edge's -value, and therefore is impractical for large projections. In this paper, we explore four potential alternatives to FDSM: fixed fill model (FFM), fixed row model (FRM),…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
