Modeling one-mode projection of bipartite networks by tagging vertex information

Abstract

h i g h l i g h t s• We propose a new method for modeling one-mode projection of bipartite networks. • Our modeling method breaks through the limitation of traditional methods. • Our one-mode collaboration network model outperforms available models. • We find that five mechanisms are common and crucial to collaboration networks. a b s t r a c tTraditional one-mode projection models are less informative than their original bipartite networks. Hence, using such models cannot control the projection's structure freely. We proposed a new method for modeling the one-mode projection of bipartite networks, which thoroughly breaks through the limitations of the available one-mode projecting methods by tagging the vertex information of bipartite networks in their one-mode projections. We designed a one-mode collaboration network model by using the method presented in this paper. The simulation results show that our model matches three real networks very well and outperforms the available collaboration network models significantly, which reflects the idea that our method is ideal for modeling one-mode projection models of bipartite graphs and that our one-mode collaboration network model captures the crucial mechanisms of the three real systems. Our study reveals that size growth, individual aging, random collaboration, preferential collaboration, transitivity collaboration and multi-round collaboration are the crucial mechanisms of collaboration networks, and the lack of some of the crucial mechanisms is the main reason that the other available models do not perform as well as ours.

Network Analysis of the Multidimensional Symptom Experience of Oncology

“…For example, modularity optimization has a resolution limit that may prevent it from detecting clusters which are comparatively small with respect to the graph as a whole, even when they are well defined communities 25 . In addition, during unweighted or weighted one-mode projection, some information is lost and the final models do not hold the complete structural information of bipartite networks 26 . As mentioned by the authors 24 , their methods concealed how the groups of symptoms co-occurred, as well as their globally optimal co-occurrence frequencies.…”

Understanding Complexity in Charging Infrastructure through the Lens of Social Supply–Demand Systems

“…Both projections may help quantify emerging CS, such as competition or collaboration [119]. Metrics for the projections that are interesting for policy makers contain the aforementioned graph metrics.…”

Similarity-based local community detection for bipartite networks

“…There are mainly two ways to curve the relationship of two different classes of objects, one is projection method, which projects the two parts of the bipartite network into a certain type of node to carry on further study, the other is nonprojection method. There are different ways of projecting different nodes into the same category, such as the unweighted projection and weighted projection [3,4], but existing experiments proved that projection operation usually causes loss of information [5][6][7]. Therefore, the use of non-projection modeling is more reasonable.…”