Nonrandom behavior in the Projection of Random bipartite networks

Abstract

There are two main categories of networks that are investigated in the complexity physics community: monopartite and bipartite networks. In this letter, we report a general finding between these two classes. If a random bipartite network is projected into a monopartite network, under quite general conditions, we obtain a non-random monopartite network with special features. We believe this finding is very general and has important real-world implications.

References in corpus (4)

• Modularity and community detection in bipartite networks
• Clustering in complex networks. I. General formalism
• On network bipartivity
• Meta-validation of bipartite network projections

Cited by in corpus (1)

• A Grand-Canonical Solution to a Class of Random Optimization Problems