Before revision:  In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, which implements a simple rule: in order for any two nodes to be linked, the number of shared neighbors must be statistically significant. Naturally, assessing the statistical significance of nodes similarity requires the definition of a proper statistical benchmark : here we consider a set of four null models, defined within the Exponential Random Graph framework.
After revision:  In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, which implements a simple rule: in order for any two nodes sharing a statistically-significant number of neighbors are linked. Since assessing the statistical significance of nodes similarity requires the definition of a proper statistical benchmark : here we consider a set of four null models, defined within the Exponential Random Graph framework.