Fast Consensus Seeking on Networks with Antagonistic Interactions

<div>States of graph <span class="nowrap"><svg height="9.25986pt" id="M994" style="vertical-align:-0.2455397pt" version="1.1" viewbox="-0.0498162 -9.01432 10.1863 9.25986" width="10.1863pt" 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="M417 653C377 677 335 687 290 687C171 687 83 622 83 541C83 462 150 415 250 398C231 363 224 320 224 292C224 212 282 165 361 165C409 165 455 180 499 209L500 208C439 89 369 16 246 16C183 16 127 48 122 79H124C131 68 141 66 153 66C181 66 197 90 197 117C197 142 173 164 146 164C111 164 87 134 87 95C87 39 157 -15 256 -15C421 -15 531 60 586 209C606 264 620 298 652 330L637 346C520 239 440 195 368 195C324 195 302 225 302 262C302 293 311 343 343 390C542 390 740 489 740 593C740 642 693 669 637 669C526 669 359 580 263 428C175 440 124 482 124 541C124 602 193 657 297 657C332 657 369 652 408 635L417 653ZM699 590C699 512 532 420 361 420C425 535 557 632 642 632C673 632 699 618 699 590Z"></path></g></svg>.</span></div>

Complexity

Fast Consensus Seeking on Networks with Antagonistic Interactions

Figure 6