Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1103/PhysRevE.86.016707 | PHYSICAL REVIEW E |
Field | DocType | Volume |
Fractal dimension,Algorithm,Theoretical computer science,Complex network,Physics | Journal | 86 |
Issue | ISSN | Citations |
1 | 1539-3755 | 9 |
PageRank | References | Authors |
1.05 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian M. Schneider | 1 | 142 | 8.29 |
| Tobias A. Kesselring | 2 | 9 | 1.05 |
| José S. Andrade Jr. | 3 | 226 | 11.32 |
| Hans J. Herrmann | 4 | 186 | 17.58 |