Exploring cooperative game mechanisms of scientific coauthorship networks
arXiv:1711.01404 · doi:10.1155/2018/9173186
Abstract
Scientific coauthorship, generated by collaborations and competitions among researchers, reflects effective organizations of human resources. Researchers, their expected benefits through collaborations, and their cooperative costs constitute the elements of a game. Hence we propose a cooperative game model to explore the evolution mechanisms of scientific coauthorship networks. The model generates geometric hypergraphs, where the costs are modelled by space distances, and the benefits are expressed by node reputations, i. e. geometric zones that depend on node position in space and time. Modelled cooperative strategies conditioned on positive benefit-minus-cost reflect the spatial reciprocity principle in collaborations, and generate high clustering and degree assortativity, two typical features of coauthorship networks. Modelled reputations generate the generalized Poisson parts and fat tails appeared in specific distributions of empirical data, e. g. paper team size distribution. The combined effect of modelled costs and reputations reproduces the transitions emerged in degree distribution, in the correlation between degree and local clustering coefficient, etc. The model provides an example of how individual strategies induce network complexity, as well as an application of game theory to social affiliation networks.
References in corpus (9)
- Principles of scientific research team formation and evolution
- Quantifying patterns of research interest evolution
- Network Cosmology
- Modes of Collaboration in Modern Science - Beyond Power Laws and Preferential Attachment
- Growth and structure of Slovenia's scientific collaboration network
- Structure of large random hypergraphs
- Distortive Effects of Initial-Based Name Disambiguation on Measurements of Large-Scale Coauthorship Networks
- Feature analysis of multidisciplinary scientific collaboration patterns based on PNAS
- Critical random hypergraphs: The emergence of a giant set of identifiable vertices