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

二分网络中的蝴蝶计数

Butterfly Counting in Bipartite Networks

Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyuce, Srikanta Tirthapura

摘要:

我们考虑的问题,计数图案的二分隶属网络,如作者的论文,用户的产品,和演员的电影关系。我们专注于计数的出现次数的“蝴蝶”,一个完整的$2 \times 2$ biclique,最简单的凝聚力在一个二分图的高阶结构。我们的主要贡献是一套随机算法,可以快速近似的蝴蝶在一个图形中的数量与可证明的保证准确性。对大型现实网络的实验评估表明,我们的算法在几秒钟内就能返回准确的估计值,即使是拥有数万亿只蝴蝶和数亿条边的网络。

英文摘要:

We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations. We focus on counting the number of occurrences of a "butterfly", a complete $2 \times 2$ biclique, the simplest cohesive higher-order structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large real-world networks shows that our algorithms return accurate estimates within a few seconds, even for networks with trillions of butterflies and hundreds of millions of edges.

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

↑