Optimal box-covering algorithm for fractal dimension of complex networks
arXiv:1204.3010 · doi:10.1103/PhysRevE.86.016707
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 not only outperforms previous ones, but also finds optimal solutions. For the two benchmark cases tested, namely, the E. Coli and the WWW networks, our results show that the improvement can be rather substantial, reaching up to 15% in the case of the WWW network.
arXiv comment5 pages, 6 figures
References in corpus (20)
- Uncovering the overlapping community structure of complex networks in nature and society
- The diameter of the world wide web
- Self-similarity of complex networks
- Efficient Immunization Strategies for Computer Networks and Populations
- Mitigation of Malicious Attacks on Networks
- Velocity and hierarchical spread of epidemic outbreaks in scale-free networks
- Origins of fractality in the growth of complex networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Skeleton and fractal scaling in complex networks
- Scaling theory of transport in complex networks
- Designing optimal transport networks
- Suppressing Epidemics with a Limited Amount of Immunization Units
- A system of mobile agents to model social networks
- How to make a fragile network robust and vice versa
- Self-similar Scale-free Networks and Disassortativity
- Erratum: Small-world networks: Evidence for a crossover picture
- Competitive cluster growth in complex networks
- Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
- Biased Percolation on Scale-free Networks
- Scaling Invariance in Spectra of Complex Networks: A Diffusion Factorial Moment Approach