Fractality and degree correlations in scale-free networks

Yuka Fujiki, Shogo Mizutaka, Kousuke Yakubo

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)


Fractal scale-free networks are empirically known to exhibit disassortative degree mixing. It is, however, not obvious whether a negative degree correlation between nearest neighbor nodes makes a scale-free network fractal. Here we examine the possibility that disassortativity in complex networks is the origin of fractality. To this end, maximally disassortative (MD) networks are prepared by rewiring edges while keeping the degree sequence of an initial uncorrelated scale-free network. We show that there are many MD networks with different topologies if the degree sequence is the same with that of the (u,v)-flower but most of them are not fractal. These results demonstrate that disassortativity does not cause the fractal property of networks. In addition, we suggest that fractality of scale-free networks requires a long-range repulsive correlation, in the sense of the shortest path distance, in similar degrees.

Original languageEnglish
Article number126
JournalEuropean Physical Journal B
Issue number7
Publication statusPublished - 2017 Jul 1


  • Statistical and Nonlinear Physics


Dive into the research topics of 'Fractality and degree correlations in scale-free networks'. Together they form a unique fingerprint.

Cite this