title: Box-covering algorithm for fractal dimension of complex networks.
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.
authors.affiliation: Computational Physics, Institute for Building Materials, Eidgenössische Technische Hochschule Zürich, Schafmattstrasse 6, 8093 Zurich, Switzerland. schnechr@mit.edu
authors.forename: Christian M
authors.initials: CM
authors.lastname: Schneider
authors.forename: Tobias A
authors.initials: TA
authors.lastname: Kesselring
authors.forename: José S
authors.initials: JS
authors.lastname: Andrade
authors.forename: Hans J
authors.initials: HJ
authors.lastname: Herrmann
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D017709:Fractals; D020407:Internet; D008962:Models, Theoretical