Pattern detection in bipartite networks: A review of terminology, applications, and methods

作者：Zachary P. Neal, Annabell Cadieux, Diego Garlaschelli, Nicholas J. Gotelli, Fabio Saracco, Tiziano Squartini, Shade T. Shutters, Werner Ulrich, Guanyang Wang, Giovanni Strona · 发表于：PLOS complex systems. · 年份：2024 · DOI：10.1371/journal.pcsy.0000010 · 被引用次数：14 · 研究领域：Economic and Technological Innovation、Computational Drug Discovery Methods

Rectangular association matrices with binary (0/1) entries are a common data structure in many research fields. Examples include ecology, economics, mathematics, physics, psychometrics, and others. Because their columns and rows are associated to distinct entities, these matrices can be equivalently expressed as bipartite networks that, in turn, can be projected onto pairs of unipartite networks. A variety of diversity statistics and network metrics can be used to quantify patterns in these matrices and networks. But, to be defined as such, what should these patterns be compared to? In all of these disciplines, researchers have recognized the necessity of comparing an empirical matrix to a benchmark ensemble of ‘null’ matrices created by randomizing certain elements of the original data. This common need has nevertheless promoted the independent development of methodologies by researchers who come from different backgrounds and use different terminology. Here, we provide a multidisciplinary review of randomization techniques and null models for matrices representing binary, bipartite networks. We aim at translating concepts from different technical domains to a common language that is accessible to a broad scientific audience. Specifically, after briefly reviewing examples of binary matrix structures encountered across different fields, we introduce the major approaches and strategies for randomizing these matrices. We then explore the details of and performance of specific t...