Estimate the fractal dimension of a complex network if the nodes of the edges

Question

I am trying to estimate the fractal dimension of a complex (real) network. I have edge nodes forming a complex network in a text file. I tried to implement an algorithm for counting boxes (but I did not find an effective implementation of an algorithm that works better for large networks), but later, after looking at the wiki’s @ page for measuring fractals in networks, I found that there is another approach for this, namely the Method of growing clusters . Is this algorithm implemented in any book / document before? (A quick google search didn't give one)

If not, can you help me implement this algorithm (since there is not much description on the wiki page, I'm confused how to get started).

Answer 1

You mentioned that you did not find an effective implementation of the box counting algorithm, so perhaps you could clarify which implementations you considered. This way, people will not offer solutions that you already know about. Moreover, what are your criteria for determining effectiveness (space, time, reliability ...)?

From the article “ How to Calculate the Fractal Dimension of a Complex Network: Box Coverage Algorithm ” by Song et al., I found the Python implementation of the box counting method available here .

Answer 2

Do not use the box-counting algorithm, because any implementation that you propose will not be faster than this ( http://repository.cmu.edu/compsci/580/ ). Ask the authors about the code and enjoy your approximation for polynomial time.

Sincerely.