An Efficient Hierarchy Algorithm for Community Detection in Complex Networks

<div>Community structures of the random graph with different <svg height="10.6388pt" id="M227" style="vertical-align:-3.571919pt" version="1.1" viewbox="-0.0498162 -7.06688 8.16381 10.6388" width="8.16381pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M570 304C570 398 525 448 414 448C385 448 343 445 312 434L329 511L321 518C297 504 262 482 244 460L233 411C195 397 159 381 128 358L135 332C160 347 189 360 224 373L111 -147C97 -210 84 -218 17 -231L13 -257L254 -247L259 -218L233 -216C183 -212 177 -202 189 -142L218 -1C238 -10 266 -12 283 -12C351 3 429 48 483 105C543 168 570 242 570 304ZM482 289C482 161 380 33 304 33C278 33 248 51 233 69L303 396C326 400 352 403 369 403C428 403 482 380 482 289Z" id="g113-113"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="593" vert-adv-y="593"></glyph.data></g></svg> got by CN agglomerative algorithm.</div>

Mathematical Problems in Engineering

fig7

Figure 7

Figure 7: An Efficient Hierarchy Algorithm for Community Detection in Complex Networks 