问题描述
我想估计一个复杂的（现实世界的）网络的分形维数。我有边缘而形成复杂的网络中的文本文件的节点。我试图实施的计盒算法（但没有找到一个有效的实现算法，这对于大型网络更好地工作的），但后来经过寻找@上网络分形维数的wiki页面，我发现还有另一种方法对于这一点，即集群成长的方法。在任何一本书/文$ P $该算法实现pviously？（快速谷歌搜索没有取得一个）
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).
推荐答案
您别说你没有找到任何有效的实现框计算算法，所以也许你能不能你回顾了实现precise。这样一来，人们就不会提出解决的办法，你已经知道了。此外，有什么确切的标准来定义效率（空间，时间，可靠性......）？
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...)?
从文如何计算的复杂网络的分形维数：盒子覆盖算法宋的等的，我找到了一个Python实现盒子计数法，可用的。
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.
这篇关于估计的复杂网络的分形维数，提供边缘节点的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！