Latent geometry of bipartite networks

Abstract

Despite the abundance of bipartite networked systems, their organizing principles are less studied, compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks, and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model, and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.

References in corpus (11)

• Hyperbolic Geometry of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Self-similarity of complex networks and hidden metric spaces
• Random hypergraphs and their applications
• The clustering coefficient and community structure of bipartite networks
• Bi-clique Communities
• Emergence of Soft Communities from Geometric Preferential Attachment
• Two classes of bipartite networks: nested biological and social systems
• Construction of bipartite and unipartite weighted networks from collections of journal papers
• Self-organization in social tagging systems
• A maximum entropy approach to separating noise from signal in bimodal affiliation networks

Cited by in corpus (9)

• A class of models for random hypergraphs
• Gender and collaboration patterns in a temporal scientific authorship network
• Scalable Hyperbolic Recommender Systems
• Network Renormalization
• Interplay between tie strength and neighbourhood topology in complex networks: Granovetter's theory and beyond
• Augmenting the User-Item Graph with Textual Similarity Models
• Mapping bipartite networks into multidimensional hyperbolic spaces
• $({\omega }_1,{\omega }_2)$-temporal random hyperbolic graphs
• The CAT SET on the MAT: Cross Attention for Set Matching in Bipartite Hypergraphs