Optimizing Pinned Nodes to Maximize the Convergence Rate of Multiagent Systems with Digraph Topologies

Figure 6

Variation of with respect to pinning strength. The solid red curve represents Algorithm 2, the dotted blue curve represents the outdegree centrality algorithm, the dashed green curve represents the hub centrality algorithm, and the dashed purple curve represents random algorithm. In (a), (b), and (c), the solid black curve represents the left eigenvector index pinning algorithm, whereas in (d), (e), and (f), it represents Algorithm 1.

(a)

(b)

(c) Epinions social network,

(d)

(e)

(f) Enron email network,