问题
I'm trying to estimate the fractal dimension of a complex(real-world) network. I have the nodes of edges forming the complex network in a text file. I tried to implement the Box Counting algorithm(but didn't find an efficient implementation of the algorithm, which works better for large networks) , but later after looking @ the wiki page on Fractal dimension on networks, I found that there is another approach for this, namely the Cluster Growing Method. Is this algorithm implemented in any book/paper previously ?(A quick google search didn't yield one)
If no, can you please help me in implementing this algorithm(as not much description is provided on the wiki-page, I'm confused how to start).
回答1:
You mention you didn't find any efficient implementation of the box counting algorithm, so maybe could you precise which implementations you reviewed. This way, people won't propose solutions you are already aware of. Moreover, what are exactly your criteria to define efficiency (space, time, reliability...)?
From the paper "How to calculate the fractal dimension of a complex network: the box covering algorithm" by Song et al., I found a Python implementation of the box counting method, available here.
回答2:
Do not implement the Box Counting algorithm, because any implementation that you propose does not will be faster than this (http://repository.cmu.edu/compsci/580/). Ask the authors for the code, and enjoy your approximation on polynomial time.
Sincerely.
来源：https://stackoverflow.com/questions/12412029/estimate-the-fractal-dimension-of-a-complex-network-provided-the-nodes-of-edges