Fig. 5: Degree distribution and an example of the three types of graphs used in the simulations.
From: Catalysing cooperation: the power of collective beliefs in structured populations
In the Erdös Rényi, the edges are generated randomly. The Newman-Watts-Strogatz graph is a small-world network. In the Barabási-Albert network, some vertices (hubs) are characterised by much higher connectivity as compared to the rest (periphery). For all graphs, Z = 32. The colours of the vertices represent strategies according to the scheme presented in Fig. 4. An analysis of varying network sizes from 32 to 252 is provided in the Supplementary Material (Supplementary Fig. 3).
