Social inertia in collaboration networks

Abstract

This work is a study of the properties of collaboration networks employing the formalism of weighted graphs to represent their one-mode projection. The weight of the edges is directly the number of times that a partnership has been repeated. This representation allows us to define the concept of "social inertia" that measures the tendency of authors to keep on collaborating with previous partners. We use a collection of empirical datasets to analyze several aspects of the social inertia: 1) its probability distribution, 2) its correlation with other properties, and 3) the correlations of the inertia between neighbors in the network. We also contrast these empirical results with the predictions of a recently proposed theoretical model for the growth of collaboration networks.

7 pages, 5 figures

References in corpus (8)

• The structure and function of complex networks
• The architecture of complex weighted networks
• Why social networks are different from other types of networks
• Problems with Fitting to the Power-Law Distribution
• Characterization and Modeling of weighted networks
• Self-organization of collaboration networks
• Network of Econophysicists: a weighted network to investigate the development of Econophysics
• A Group-Based Yule Model for Bipartite Author-Paper Networks

Cited by in corpus (14)

• Quantifying social group evolution
• How to project a bipartite network?
• Prominence and control: The weighted rich-club effect
• Detecting Important Nodes to Community Structure Using the Spectrum of the Graph
• Scientific success from the perspective of the strength of weak ties
• Transport on weighted Networks: when correlations are independent of degree
• Online detection of temporal communities in evolving networks by estrangement confinement
• Randomizing hypergraphs preserving degree correlation and local clustering
• Social inertia and diversity in collaboration networks
• Relational hyperevent models for the coevolution of coauthoring and citation networks
• Modelling temporal and spatial features of collaboration network
• Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization
• Using tf-idf as an edge weighting scheme in user-object bipartite networks
• A New Approach to Detect Important Members that Create the Communities in Bipartite Networks