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

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/4096981/figures/4096981.fig.004a.svgz" name="4096981.fig.004a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Enron email network, <svg height="8.55521pt" id="M403" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.34882 37.1406 8.55521" width="37.1406pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M484 406C484 429 465 448 438 448C400 448 352 405 302 356L156 213L191 373C195 391 197 404 197 416C197 436 191 448 178 448C151 448 83 406 23 350L37 328C67 350 101 369 109 369C114 369 115 362 111 344L29 -5L34 -12C63 -5 86 -1 111 3C124 73 137 138 147 161C165 180 189 202 206 217C215 194 249 111 275 57C304 -1 319 -12 342 -12C368 -12 405 -5 471 92L454 115C427 80 395 55 384 55C374 55 364 58 341 106L262 274C282 296 367 378 414 378C427 378 440 370 444 367C449 363 454 362 462 368C476 379 484 395 484 406Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.224,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.487,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,27.727,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,30.691,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g></svg></td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/4096981/figures/4096981.fig.004b.svgz" name="4096981.fig.004b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Enron email network, <svg height="8.55521pt" id="M404" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.34882 40.4289 8.55521" width="40.4289pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M484 406C484 429 465 448 438 448C400 448 352 405 302 356L156 213L191 373C195 391 197 404 197 416C197 436 191 448 178 448C151 448 83 406 23 350L37 328C67 350 101 369 109 369C114 369 115 362 111 344L29 -5L34 -12C63 -5 86 -1 111 3C124 73 137 138 147 161C165 180 189 202 206 217C215 194 249 111 275 57C304 -1 319 -12 342 -12C368 -12 405 -5 471 92L454 115C427 80 395 55 384 55C374 55 364 58 341 106L262 274C282 296 367 378 414 378C427 378 440 370 444 367C449 363 454 362 462 368C476 379 484 395 484 406Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.224,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.487,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,27.727,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,33.967,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g></svg></td></tr></table>

<div>Dynamics of <svg height="11.5564pt" id="M402" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 30.7511 11.5564" width="30.7511pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M517 162C503 123 484 88 467 68C445 42 417 34 341 34C291 34 256 34 237 47C219 59 213 81 213 128V317H308C395 317 402 311 415 240H444V431H415C403 364 398 356 307 356H213V584C213 613 215 616 246 616H322C394 616 421 609 435 587C448 566 458 544 467 502L496 506C493 557 488 625 488 650H42V622C120 616 128 612 128 523V125C128 43 120 35 29 28V0H511C520 31 540 125 546 158L517 162Z"></path></g><g transform="matrix(.013,0,0,-0.013,7.384,0)"><path d="M181 342V451C133 431 89 419 40 411V388C98 381 102 377 102 311V104C102 38 95 32 33 26V0H263V26C186 32 181 38 181 104V287C203 343 235 372 261 372C277 372 289 366 304 352C310 346 318 345 330 350C349 359 362 379 362 399C362 422 338 449 304 449C256 449 213 393 183 342H181Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.285,0)"><path d="M181 342V451C133 431 89 419 40 411V388C98 381 102 377 102 311V104C102 38 95 32 33 26V0H263V26C186 32 181 38 181 104V287C203 343 235 372 261 372C277 372 289 366 304 352C310 346 318 345 330 350C349 359 362 379 362 399C362 422 338 449 304 449C256 449 213 393 183 342H181Z"></path></g><g transform="matrix(.013,0,0,-0.013,17.108,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.606,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z"></path></g><g transform="matrix(.013,0,0,-0.013,26.04,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"></path></g></svg> with different pinning algorithms. The pinned node number is fixed to be 6.</div>

Complexity

fig4

Figure 4

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