Clustering drives cooperation on reputation networks, all else fixed

Reputation-based cooperation on social networks offers a causal mechanism between graph properties and social trust. Using a simple model, this paper demonstrates the underlying mechanism in a way that is accessible to scientists not specializing in networks or mathematics. The paper shows that when the size and degree of the network is fixed (i.e. all graphs have the same number of agents, who all have the same number of connections), it is the clustering coefficient that drives differences in how cooperative social networks are.