A self-adaptive bi-particle graph model for scientific collaboration
Author(s) -
He Yue,
Pei-Pei Zhang,
Xu Tian,
Yumei Jiang,
Da-Ren He
Publication year - 2004
Publication title -
acta physica sinica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.53.1710
Subject(s) - computer science , graph , principal (computer security) , projection (relational algebra) , theoretical computer science , particle (ecology) , algorithm , oceanography , geology , operating system
This paper suggests a self-adaptive bi-particle graph model, which describes the collaboration network between the principal investigators and their assistants. The model considers the choices, strategies, competitions, and the induced evolutions of the principal investigators and their assistants as actors as well as the evolution of the whole network. The simulation results of all the different single-particle graphs obtained by different methods of projection show a good agreement with the statistical data of the collaboration between American mathematicians and neuroscientists during 1991 and 1998 That shows a self-adaptive complex network can selforganize to a small world and scale-free structure. This article also discusses the similarities and differences of the simulation results of the different projected single-particle graphs of the bi-particle graph.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom