Figure 8. Synthetic heterogeneous networks (Barabási-Albert scale-free networks) only give rise to coordination failures when there is lack of redundant paths.

Stationary density of cooperators x* as a function of game parameter T, for three instances of Barabási-Albert scale-free networks with degrees k = 2, 4, and 8 (see legend). Redundant paths between nodes are only scarce for the case of k = 2, which is strictly a tree by construction. Notice also that clustering is very low in all three cases (mean value <0.01). Network size is N = 10⁴ nodes, network generation parameters are m ₀ = m = k/2 [54].