社会网络最短路矩阵积收敛速度的下界
Lower Bounds on Rate of Convergence of Matrix Products in All Pairs Shortest Path of Social Network
摘要:
随着社交网络应用的迅速发展,社交网络已经成为人们进行交互的重要媒介。对于网络中所有对的最短距离计算,Alon N[4]提出了一种矩阵乘法算法,结合距离乘积结合律和分块矩阵乘法,网络上所有对的最短路长算法具有时间界O((2n^3)/Blogn)。在实际应用中,考虑到社交网络的无标度特性和浮点运算对计算机硬件的精度限制,我发现最短路径算法具有改进的时间界O((14n^3)/B)。在此基础上,利用距离乘积算法中的矩阵乘法、距离乘积关联律、分块矩阵乘法、社交网络的无标度特性以及硬件浮点运算的局限性,提出了一种结合稀疏性判断和收敛性判断的全对最短路径算法。在一个包含8508个参与者的社交网络数据集上进行测试,与Alon N算法相比,该算法在CPU和GPU上的性能提高了39%~ 36.2倍。
英文摘要:
With the rapid development of social network applications, social network has become an important medium for people to interact. For the minimum distance computation of all pairs in networks, Alon N[4] proposed an algorithm with matrix multiplication, combining with distance product association law and block matrix multiplication, all pairs shortest path length algorithm on networks has time bound O((2n^3)/B logn). In practical applications, considering the scale-free characteristics of social networks and the precision limitations of floating-point operations on computer hardware, I found that the shortest path algorithm has an improved time bound O((14n^3)/B). Based on the above theory, I propose an all pairs shortest path algorithm that combines sparseness judgment and convergence judgment, leveraging the distance product algorithm with matrix multiplication, distance product association law, block matrix multiplication, scale-free characteristics of social networks, and limitation of floating-point operations on hardware. Testing on a social network dataset with 8508 actors, compared to Alon N algorithm, proposed algorithm has a performance improvement of 39% to 36.2 times on CPU and GPU.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。