Optimal box-covering algorithm for fractal dimension of complex networks

Details Optimal box-covering algorithm for fractal dimension of complex networks Optimal box-covering algorithm for fractal dimension of complex networks

2012-04-13

arxiv.org/abs/1204.3010v1

Physics

Computational Physics

5 pages, 6 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal box-covering algorithm for fractal dimension of complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal box-covering algorithm for fractal dimension of complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal box-covering algorithm for fractal dimension of complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144294