Box-covering algorithm for fractal dimension of complex networks
Name
Schneider-2012-Box-covering algorithm for fractal dimension of complex networks.pdf
Size
479.45 KB
Format
Adobe PDF
Checksum (MD5)
7593f5f459b293d239a438f666429fda
Author(s)
Schneider, Christian Michael
Kesselring, Tobias A.
Jose, Andrade, S. Jr.
Herrmann, Hans J.
Date Issued
July 2012
Journal
Physical Review E
Publisher
American Physical Society
Citation
Schneider, Christian et al. “Box-covering Algorithm for Fractal Dimension of Complex Networks.” Physical Review E 86.1 (2012). ©2012 American Physical Society
Version
Final published version
Abstract
The self-similarity of complex networks is typically investigated through computational algorithms, the primary task of which is to cover the structure with a minimal number of boxes. Here we introduce a box-covering algorithm that outperforms previous ones in most cases. For the two benchmark cases tested, namely, the E. coli and the World Wide Web (WWW) networks, our results show that the improvement can be rather substantial, reaching up to 15% in the case of the WWW network.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1103/PhysRevE.86.016707
