一种用于评估矩阵函数的快速蒙特卡洛算法及其在复杂网络中的应用
A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
AI总结:
提出一种通过随机采样整行整列来近似矩阵函数的蒙特卡洛算法,显著提升收敛速度,并在大型网络的子图中心性和总通信性计算中优于现有方法,可高效扩展至64核。
摘要:
我们提出了一种新颖的随机算法,该算法随机采样矩阵的整行和整列,以利用幂级数展开来近似任意矩阵函数。这与现有的蒙特卡洛方法形成对比,后者一次仅处理一个条目,从而使得我们的方法比原始方法具有显著更好的收敛速度。为了评估我们方法的适用性,我们计算了几个大型网络的子图中心性和总通信性。在迄今为止分析的所有基准测试中,我们方法的性能显著优于竞争对手,能够以出色的效率扩展到64个CPU核心。
英文摘要:
We propose a novel stochastic algorithm that randomly samples entire rows and columns of the matrix as a way to approximate an arbitrary matrix function using the power series expansion. This contrasts with existing Monte Carlo methods, which only work with one entry at a time, resulting in a significantly better convergence rate than the original approach. To assess the applicability of our method, we compute the subgraph centrality and total communicability of several large networks. In all benchmarks analyzed so far, the performance of our method was significantly superior to the competition, being able to scale up to 64 CPU cores with remarkable efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。