Figure 7: The critical value curves comparisons of matching equal, inverse or random ranks of node degrees and commitments.
From: The impact of variable commitment in the Naming Game on consensus formation
The committed agents are selected by three different strategies mentioned above. All the experiments are based on networks generated by Barabasi-Albert (BA) and Erdos-Renyi (ER) models with parameters N = 1000, m0 = m = 5, p ≈ 0.01, where the average degree of each network is 10, the mean of commitment strengths 
of each distribution is 10. Each critical value is averaged over 100 runs. For all subfigures, the x-axis is pA, the y-axis is pB. For simplicity, we just plot the critical values when pA > pB. Subfigures (a–f) show experiments of the waning commitment naming game, while subfigures (g–l) show experiments of the variable commitment naming game. Subfigures (a–c) and (g–i) are simulations in BA networks, while subfigures (d–f) and (j–l) are simulations in ER networks.
