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

大型动态图中三角形的边抽样计数

On Counting Triangles through Edge Sampling in Large Dynamic Graphs

Guyue Han, Harish Sethu

摘要:

传统的动态图框架只依赖于处理添加到进化图中或从进化图中删除的边的流,而不是任何附加的相关信息,例如与边相关的节点的度或邻居列表。在本文中,我们提出了一个新的边缘采样框架,用于动态图中的大图分析,通过使用额外的相关信息来增强传统模型。为了证明这个框架的优点,我们提出了一个新的采样算法,称为边缘采样和丢弃(ESD)。它生成三角形总数的无偏估计,可以根据边的添加和删除不断更新。我们提供了一个比较分析的性能ESD对两个当前国家的最先进的算法的准确性和复杂性。在真实图上进行的实验结果表明,在采样边缘邻域信息的帮助下,我们的算法所达到的准确性明显更好。我们还描述了几个Barabasi-Albert图上的测试,我们的算法的性能上的图的属性的影响。

英文摘要:

Traditional frameworks for dynamic graphs have relied on processing only the stream of edges added into or deleted from an evolving graph, but not any additional related information such as the degrees or neighbor lists of nodes incident to the edges. In this paper, we propose a new edge sampling framework for big-graph analytics in dynamic graphs which enhances the traditional model by enabling the use of additional related information. To demonstrate the advantages of this framework, we present a new sampling algorithm, called Edge Sample and Discard (ESD). It generates an unbiased estimate of the total number of triangles, which can be continuously updated in response to both edge additions and deletions. We provide a comparative analysis of the performance of ESD against two current state-of-the-art algorithms in terms of accuracy and complexity. The results of the experiments performed on real graphs show that, with the help of the neighborhood information of the sampled edges, the accuracy achieved by our algorithm is substantially better. We also characterize the impact of properties of the graph on the performance of our algorithm by testing on several Barabasi-Albert graphs.

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

↑