Optimal Design on Robustness of Scale-Free Networks Based on Degree Distribution

<div>The characteristics of <svg height="8.93365pt" id="M55" style="vertical-align:-0.1672497pt" version="1.1" viewbox="-0.0498162 -8.7664 35.5922 8.93365" width="35.5922pt" 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="M673 0V28C608 34 594 43 563 129C499 303 432 494 370 665L339 656L132 132C98 43 84 37 20 28V0H238V28C162 35 154 45 175 108C188 150 203 192 219 237H432C454 176 474 122 487 83S491 36 428 28V0H673ZM418 280H234C265 362 296 450 328 535H330L418 280Z" id="g121-63"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="691" vert-adv-y="691"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,8.122,0)"><path d="M592 498C586 556 582 629 581 675H560C545 656 537 650 510 650H115C87 650 74 652 60 675H40C38 620 33 555 28 495H57C69 539 77 568 89 585C102 607 122 616 205 616H267V123C267 44 259 34 168 28V0H454V28C360 34 352 44 352 123V616H422C498 616 514 608 531 584C542 568 552 543 562 495L592 498Z" id="g121-82"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="617" vert-adv-y="617"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,16.143,0)"><path d="M719 650H483V622C553 619 576 606 581 560C585 532 588 487 588 394V148H585L167 650H20V622C67 618 88 610 109 585C127 562 129 557 129 484V264C129 173 126 124 123 93C118 44 92 31 35 28V0H272V28C204 32 181 44 176 95C173 124 170 172 170 264V515H172L598 -9H629V394C629 487 631 532 635 563C639 606 663 619 719 622V650Z" id="g121-76"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="743" vert-adv-y="743"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,25.802,0)"><path d="M43 650V622C120 616 128 612 128 526V124C128 39 120 33 34 27V0H270C392 0 492 25 567 83C643 141 690 230 690 350C690 444 655 517 605 565C543 625 450 650 323 650H43ZM213 547C213 587 217 598 226 604C236 612 262 617 304 617C371 617 429 604 474 576C554 529 592 439 592 336C592 176 505 36 319 36C246 36 213 55 213 131V547Z" id="g121-66"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="735" vert-adv-y="735"></glyph.data></g></svg> versus <svg height="12.7178pt" id="M56" style="vertical-align:-3.42947pt" version="1.1" viewbox="-0.0498162 -9.28833 7.68094 12.7178" width="7.68094pt" 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="M558 587C558 666 497 712 432 712C379 712 330 691 284 650C212 586 178 508 148 348L71 -65C49 -185 35 -229 23 -235L27 -261C49 -259 101 -251 124 -224C131 -216 138 -178 159 -24C171 66 197 200 227 356C264 550 295 668 393 668C443 668 479 632 479 575C479 516 446 458 383 418C361 404 344 398 318 397L296 350C395 338 460 281 460 192C460 110 411 40 300 40C258 40 215 55 192 69L181 51C191 18 222 -16 266 -16C308 -16 351 1 397 26C471 67 545 142 545 221C545 315 486 365 401 395C469 437 558 498 558 587Z" id="g113-224"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="581" vert-adv-y="581"></glyph.data></g></svg> with different <svg height="8.8423pt" id="M57" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 11.0475 8.8423" width="11.0475pt" 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="M822 650H589L583 622C660 617 677 607 674 561C672 534 664 481 647 390L600 137H596L273 650H126L120 622C176 620 194 615 207 594C221 571 225 557 214 504L161 257C141 166 129 112 121 85C108 42 83 30 29 28L23 0H260L266 28C193 33 173 42 176 89C178 122 186 172 202 255L256 527H259L583 -8H612L690 390C708 481 720 535 728 558C744 603 756 619 816 622L822 650Z" id="g113-79"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="839" vert-adv-y="839"></glyph.data></g></svg>.</div>

Scientific Programming

fig3

Figure 3

Figure 3: Optimal Design on Robustness of Scale-Free Networks Based on Degree Distribution 