The Local Triangle Structure Centrality Method to Rank Nodes in Networks

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/9057194/figures/9057194.fig.002a.svgz" name="9057194.fig.002a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Karate</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/9057194/figures/9057194.fig.002b.svgz" name="9057194.fig.002b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Polbook</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/9057194/figures/9057194.fig.002c.svgz" name="9057194.fig.002c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Netscience</td></tr><tr class="fig-image" id="d"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/9057194/figures/9057194.fig.002d.svgz" name="9057194.fig.002d" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(d) </b>Email</td></tr></table>

<div><svg height="8.8423pt" id="M106" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 34.6658 8.8423" width="34.6658pt" 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="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g><g transform="matrix(.013,0,0,-0.013,8.684,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g><g transform="matrix(.013,0,0,-0.013,16.977,0)"><path d="M743 375C743 570 607 650 407 650H136L130 622C214 612 220 606 204 526L125 122C110 43 105 36 24 27L17 0H250C382 0 482 23 571 76C680 141 743 248 743 375ZM644 379C644 188 520 36 305 36C277 36 249 38 229 46C205 55 202 71 212 126L293 553C300 588 306 600 317 606C330 613 356 617 390 617C547 617 644 537 644 379Z"></path></g><g transform="matrix(.013,0,0,-0.013,26.544,0)"><path d="M584 650H137L131 622C214 614 217 612 200 521L125 127C109 41 101 35 23 28L17 0H288L294 28C201 35 193 42 209 128L242 309H348C440 309 442 300 443 226H471L510 422H482C452 354 449 348 357 348H251L295 575C302 609 304 615 338 615H426C502 615 517 604 526 581C534 560 536 524 537 492L565 494C574 554 583 631 584 650Z"></path></g></svg> curves are plotted to rank the importance of nodes in Karate, Polbook, Netscience, and Email networks.</div>

Complexity

fig2

Figure 2

Figure 2: The Local Triangle Structure Centrality Method to Rank Nodes in Networks 