TY - JOUR
T1 - Modeling one-mode projection of bipartite networks by tagging vertex information
AU - Qiao, Jian
AU - Meng, Ying Ying
AU - Chen, Hsinchun
AU - Huang, Hong Qiao
AU - Li, Guo Ying
N1 - Publisher Copyright:
© 2016 Elsevier B.V. All rights reserved.
PY - 2016/9/1
Y1 - 2016/9/1
N2 - Traditional 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.
AB - Traditional 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.
KW - Bipartite networks
KW - Collaboration network model
KW - Collaboration networks
KW - One-mode projection
UR - http://www.scopus.com/inward/record.url?scp=84964389836&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964389836&partnerID=8YFLogxK
U2 - 10.1016/j.physa.2016.03.106
DO - 10.1016/j.physa.2016.03.106
M3 - Article
AN - SCOPUS:84964389836
SN - 0378-4371
VL - 457
SP - 270
EP - 279
JO - Physica A: Statistical Mechanics and its Applications
JF - Physica A: Statistical Mechanics and its Applications
ER -