Comparing Models for Extracting the Backbone of Bipartite Projections

05/27/2021
by   Zachary P. Neal, et al.
0

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 that would otherwise be difficult or impossible to measure directly. A key challenge in analyzing such networks is determining whether an observed number of co-occurrences is significant. Several models now exist for doing so and thus for extracting the backbone of bipartite projections, but they have not been directly compared to each other. In this paper, we compare five such models – fixed fill model (FFM) fixed row model (FRM), fixed column model (FCM), fixed degree sequence model (FDSM), and stochastic degree sequence model (SDSM) – in terms of accuracy, speed, statistical power, similarity, and community detection. We find that the computationally-fast SDSM offers a statistically conservative but close approximation of the computationally-impractical FDSM under a wide range of conditions, and that it correctly recovers a known community structure even when the signal is weak. Therefore, although each backbone model may have particular applications, we recommend SDSM for extracting the backbone of most bipartite projections.

READ FULL TEXT

page 1

page 8

page 10

research
03/12/2014

Efficiently inferring community structure in bipartite networks

Bipartite networks are a common type of network data in which there are ...
research
01/22/2020

Community Detection in Bipartite Networks with Stochastic Blockmodels

In bipartite networks, community structures are restricted to being disa...
research
03/15/2017

Matched bipartite block model with covariates

Community detection or clustering is a fundamental task in the analysis ...
research
06/29/2020

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence

We provide asymptotic formulae for the numbers of bipartite graphs with ...
research
06/12/2018

Bipartite graph analysis as an alternative to reveal clusterization in complex systems

We demonstrate how analysis of co-clustering in bipartite networks may b...
research
11/15/2010

Evolutionary method for finding communities in bipartite networks

An important step in unveiling the relation between network structure an...
research
03/15/2018

Optimal Bipartite Network Clustering

We consider the problem of bipartite community detection in networks, or...

Please sign up or login with your details

Forgot password? Click here to reset