Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-11T12:24:23.096Z Has data issue: false hasContentIssue false

Structural Inequality in Collaboration Networks

Published online by Cambridge University Press:  10 June 2022

Rafael Ventura*
Affiliation:
University of Pennsylvania, 112 Leidy Labs, 3740 Hamilton Walk, Philadelphia, 19104 PA, United States
Rights & Permissions [Opens in a new window]

Abstract

Recent models of scientific collaboration show that minorities can end up at a disadvantage in bargaining scenarios. However, these models presuppose the existence of social categories. Here, I present a model of scientific collaboration in which inequality arises in the absence of social categories. I assume that all agents are identical except for the position that they occupy in the collaboration network. I show that inequality arises in the absence of social categories. I also show that this is due to the structure of the collaboration network and that similar patterns arise in two real-world collaboration networks.

Information

Type
Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of the Philosophy of Science Association
Figure 0

Table 1.Payoffs in the mini-Nash demand game. In each cell, the first and second entries represent the payoff to the row and column players. Note that $L \lt M=0.5 \lt H$, and $L+H=1$

Figure 1

Figure 1.Network topologies. Left: Regular network with d = 2. Center: Regular network with d = 5. Right: Scale-free network given by the preferential-attachment model described by Barabási and Albert (1999) with one initial node. Shown are networks with N = 30.

Figure 2

Figure 2.Frequency of $\boldsymbol{Med}$ over time. Left: When L = 0.1, Med takes over regular networks with d = 2 (dotted) and d = 5 (dashed); the equilibrium frequency of Med is 0.7 in scale-free networks (solid). Right: When L = 0.4, Med takes over regular networks with d = 5, but the frequency of Med is 0.4 in regular networks with d = 2 and 0.33 in scale-free networks. Results are the average of 100 runs, with update probability equal to 0.1, and N = 100.

Figure 3

Figure 3.Equilibrium composition and inequality. Left: The equilibrium composition depends on L. Right: The GI decreases with L, whereas the SI increases with L. Results are the average of 100 runs with 100 time steps, with update probability equal to 0.1, and N = 100.

Figure 4

Figure 4.Degree inequality in model networks. Left: When L is low, the average degree of those playing High is higher than the average degree of those playing Low; the pattern is reversed when L is high. Results are the average of 100 runs, with 100 times steps, update probability equal to 0.1, and N = 100. Right: Population composition after 100 rounds of interactions in a scale-free collaboration network with L = 0.1.

Figure 5

Figure 5.Degree inequality in real-world networks. In the Erdos (N = 4,158; left) and GR-QC (N = 5,094; right) collaboration networks, the average degree of agents who play High is higher than the average degree of agents who play Low when L is low; the pattern is reversed when L is high. Results are the average of 100 runs, with 100 time steps and update probability equal to 0.1.

Figure 6

Figure 6.Degree distribution in model and two real-world networks. Left: The degree distribution given by $P(d) = N \cdot d^{-\gamma }$ with $\gamma = 2$ (solid line) approximates the degree distribution in the Erdos collaboration network (N = 4,158). Right: The same expression approximates the observed degree distribution in the GR-QC collaboration network (N = 5,094). Gray bars show empirical degree distribution.

Figure 7

Figure 7.Initial probabilities that Low and $l{High}$ are a best response. Left: Initial probability that Low and High are a best response for d = 1, d = 2, and d = 5 when L = 0.1. Right: Initial probability that Low and High are a best response for d = 1, d = 2, and d = 5 when L = 0.4.