一种用于千万级复杂网络多重分形分析的高效沙箱算法
A computationally-efficient sandbox algorithm for multifractal analysis of large-scale complex networks with tens of millions of nodes
摘要:
多重分形分析(MFA)是系统描述理论和实验分形格局空间异质性的有效工具。分形分析中应用最广泛的方法之一是盒覆盖法。它是NP难的。更严重的是,与分形分析算法相比,MFA算法具有更高的计算复杂度。在复杂网络的各种MFA算法中,沙箱MFA算法表现出最好的计算效率。然而,现有的沙箱算法仍然是计算昂贵的。对于具有数千万节点的大规模网络,实现MFA变得具有挑战性。也不清楚MFA结果是否可以通过大幅增加理论网络的大小来改善。为了解决这些问题,本文提出了一种计算效率高的沙箱算法(CESA),用于大规模网络的MFA。我们的CESA采用广度优先搜索(BFS)技术,直接搜索每层中心节点的邻居节点,然后检索所需的信息。我们的CESA的输入是一个稀疏的数据结构,来自压缩稀疏行(CSR)格式设计的压缩存储的邻接矩阵的大规模网络。理论分析表明,CESA将现有沙箱算法的时间复杂度从三次降低到二次,空间复杂度从二次提高到线性。对典型的复杂网络进行了MFA实验,以验证我们的CESA。最后,我们的CESA被应用到几个典型的现实世界的大规模网络。
英文摘要:
Multifractal analysis (MFA) is a useful tool to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. One of the widely used methods for fractal analysis is box-covering. It is known to be NP-hard. More severely, in comparison with fractal analysis algorithms, MFA algorithms have much higher computational complexity. Among various MFA algorithms for complex networks, the sandbox MFA algorithm behaves with the best computational efficiency. However, the existing sandbox algorithm is still computationally expensive. It becomes challenging to implement the MFA for large-scale networks with tens of millions of nodes. It is also not clear whether or not MFA results can be improved by a largely increased size of a theoretical network. To tackle these challenges, a computationally-efficient sandbox algorithm (CESA) is presented in this paper for MFA of large-scale networks. Our CESA employs the breadth-first search (BFS) technique to directly search the neighbor nodes of each layer of center nodes, and then to retrieve the required information. Our CESA's input is a sparse data structure derived from the compressed sparse row (CSR) format designed for compressed storage of the adjacency matrix of large-scale network. A theoretical analysis reveals that the CESA reduces the time complexity of the existing sandbox algorithm from cubic to quadratic, and also improves the space complexity from quadratic to linear. MFA experiments are performed for typical complex networks to verify our CESA. Finally, our CESA is applied to a few typical real-world networks of large scale.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。