Nonrandom behavior in the Projection of Random bipartite networks
arXiv:2304.12258 · doi:10.1103/PhysRevE.109.024308
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 (12)
- Statistical mechanics of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Classes of behavior of small-world networks
- Why social networks are different from other types of networks
- How to project a bipartite network?
- Recommender Systems
- Modularity and community detection in bipartite networks
- Bipartite Graphs as Models of Complex Networks
- Self-organization of collaboration networks
- Clustering in complex networks. I. General formalism
- On network bipartivity
- Meta-validation of bipartite network projections