Box-covering algorithm for fractal dimension of complex networks
Author(s)Schneider, Christian Michael; Kesselring, Tobias A.; Jose, Andrade, S. Jr.; Herrmann, Hans J.
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
Physical Review E
American Physical Society
Schneider, Christian et al. “Box-covering Algorithm for Fractal Dimension of Complex Networks.” Physical Review E 86.1 (2012). ©2012 American Physical Society
Final published version