arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.00494cs.DS
收藏

用伪维理论估计大型网络的渗流中心性

Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory

Alane M. de Lima, Murilo V. G. da Silva, André L. Vignatti

摘要:

在这项工作中,我们研究了估计图中每个顶点的渗透中心性的问题。这种中心性度量量化了图中每个顶点在经历传染过程时的重要性。对于任意常数$c>0$,能否在$\mathcal{O}(n^{3-c})$时间内计算渗流中心性是一个悬而未决的问题。在本文中,我们提出了一个$\mathcal{O}(m \log^2 n)$随机近似算法的渗流中心为每个顶点的$G$,推广技术开发的Riondato,Upfal和Kornaropoulos(这种复杂性降低到$\mathcal{O}((m+n) \log n)$的未加权图)。对于{ \it固定}常数$0 < ε,δ\leq 1$,通过该算法获得的估计值在精确值的$ε$内,概率为$1-δ$。事实上,我们在实验分析中表明,在现实世界复杂网络的情况下,我们的算法产生的输出比理论上最坏情况分析的保证更接近精确值。

英文摘要:

In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open problem whether the percolation centrality can be computed in $\mathcal{O}(n^{3-c})$ time, for any constant $c>0$. In this paper we present a $\mathcal{O}(m \log^2 n)$ randomized approximation algorithm for the percolation centrality for every vertex of $G$, generalizing techniques developed by Riondato, Upfal e Kornaropoulos (this complexity is reduced to $\mathcal{O}((m+n) \log n)$ for unweighted graphs). The estimation obtained by the algorithm is within $ε$ of the exact value with probability $1-δ$, for {\it fixed} constants $0 < ε,δ\leq 1$. In fact, we show in our experimental analysis that in the case of real world complex networks, the output produced by our algorithm is significantly closer to the exact values than its guarantee in terms of theoretical worst case analysis.

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

↑