大数据系统松弛过程的快速算法
Fast Algorithm for Relaxation Processes in Big-data Systems
摘要:
拉普拉斯矩阵驱动的松弛过程可以在许多现实世界的大数据系统中找到,例如,在万维网上的搜索引擎和网状网络中的动态负载平衡协议中。为了在数值上实现这样的过程,用于计算拉普拉斯矩阵的伪逆的快速运行算法是必不可少的。在这里,我们提出了一个算法,快速,有效地计算伪逆的马尔可夫链生成矩阵满足详细平衡条件,一般类的矩阵,包括拉普拉斯算子。该算法利用高斯积分的重整化。除了它的适用范围广泛的问题,该算法优于其他算法的能力,在一个可管理的计算时间内计算任意元素的伪逆矩阵的大小数百万的数百万。因此,我们的算法可以非常广泛地用于分析发生在大规模网络系统的松弛过程。
英文摘要:
Relaxation processes driven by a Laplacian matrix can be found in many real-world big-data systems, for example, in search engines on the World-Wide-Web and the dynamic load balancing protocols in mesh networks. To numerically implement such processes, a fast-running algorithm for the calculation of the pseudo inverse of the Laplacian matrix is essential. Here we propose an algorithm which computes fast and efficiently the pseudo inverse of Markov chain generator matrices satisfying the detailed-balance condition, a general class of matrices including the Laplacian. The algorithm utilizes the renormalization of the Gaussian integral. In addition to its applicability to a wide range of problems, the algorithm outperforms other algorithms in its ability to compute within a manageable computing time arbitrary elements of the pseudo inverse of a matrix of size millions by millions. Therefore our algorithm can be used very widely in analyzing the relaxation processes occurring on large-scale networked systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。