arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.13679cs.DScs.SI
收藏

复杂网络分析中Laplacian伪逆的对角逼近

Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis

Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke

摘要:

大量图形数据集在众多应用程序中无处不在,需要快速算法从这些数据中提取知识。我们在这里的动机是三个电气措施的分析大的小世界图$G = (V, E)$ -即,$O(\log |V|)$中具有直径的图,这类图在复杂网络分析中非常丰富。从计算的角度来看,这三个措施有一个共同点,他们的关键组成部分是对角线的图形拉普拉斯的伪逆,$L^\dagger$。然而,通过伪求逆精确计算diag $(L^\dagger)$与密集矩阵乘法一样昂贵,实际上标准工具甚至需要立方时间。此外,伪逆需要二次空间-对于大型图几乎不可行。采用近似法,例如,使用Johnson-Lindenstrauss变换,需要求解$O(\log |V| / ε^2)$拉普拉斯线性系统以保证相对误差,这对于大输入仍然是非常昂贵的。在本文中,我们提出了一种新的近似算法,只需要一个拉普拉斯线性系统的解决方案。其余部分是纯组合的--主要是采样均匀生成树,我们通过有效电阻将其与diag $(L^\dagger)$联系起来。对于小世界网络,我们的算法获得了一个$\pm ε$ -近似的概率很高,在一个时间,是近线性的$|E|$和二次的$1 / ε$。我们的算法的另一个积极方面是由于独立采样的并行性。因此,我们提供了我们的算法的两个并行实现:一个使用OpenMP,一个MPI + OpenMP。在我们的实验中,我们的算法(i)产生更准确的结果,(ii)速度更快,内存效率更高,(iii)获得良好的并行加速比,特别是在分布式环境中。

英文摘要:

The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measures for the analysis of large small-world graphs $G = (V, E)$ -- i.e., graphs with diameter in $O(\log |V|)$, which are abundant in complex network analysis. From a computational point of view, the three measures have in common that their crucial component is the diagonal of the graph Laplacian's pseudoinverse, $L^\dagger$. Computing diag$(L^\dagger)$ exactly by pseudoinversion, however, is as expensive as dense matrix multiplication -- and the standard tools in practice even require cubic time. Moreover, the pseudoinverse requires quadratic space -- hardly feasible for large graphs. Resorting to approximation by, e.g., using the Johnson-Lindenstrauss transform, requires the solution of $O(\log |V| / ε^2)$ Laplacian linear systems to guarantee a relative error, which is still very expensive for large inputs. In this paper, we present a novel approximation algorithm that requires the solution of only one Laplacian linear system. The remaining parts are purely combinatorial -- mainly sampling uniform spanning trees, which we relate to diag$(L^\dagger)$ via effective resistances. For small-world networks, our algorithm obtains a $\pm ε$-approximation with high probability, in a time that is nearly-linear in $|E|$ and quadratic in $1 / ε$. Another positive aspect of our algorithm is its parallel nature due to independent sampling. We thus provide two parallel implementations of our algorithm: one using OpenMP, one MPI + OpenMP. In our experiments against the state of the art, our algorithm (i) yields more accurate results, (ii) is much faster and more memory-efficient, and (iii) obtains good parallel speedups, in particular in the distributed setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑