计算真实世界图形流中的三角形:处理重复边和时间窗口
Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows
摘要:
真实世界的图形通常表现为大量的边的时间流。实时分析这种大型图形流的需求导致了低内存、单通道流式图形算法的进展。这些算法是为简单图设计的,假设边在流中不重复。然而,真实的图流几乎总是多重图,即,它们包含许多重复的边。没有重复边缘的假设需要一个额外的通道 * 存储所有边缘 *,仅用于重复数据删除,这违背了小内存算法的目的。我们描述了一个算法,用于估计三角形计数的多重图流的边缘。我们表明,所有以前的流算法三角形计数失败的多重图流,尽管他们令人印象深刻的精度为简单的图形。重复边产生的偏差是一个主要问题,并导致这些算法误入歧途。我们的算法通过仔细的去偏策略避免了这些偏差,并具有可证明的理论保证和出色的经验性能。我们的算法建立在前面介绍的楔形抽样方法。分析时间图的另一个挑战是找到正确的时间窗口大小。我们的算法无缝地处理多个时间窗口,并且不需要先验地承诺任何窗口大小。我们应用我们的算法,发现迷人的传递性和三角形的趋势,在现实世界的图形流。
英文摘要:
Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass streaming graph algorithms. These algorithms were designed for simple graphs, assuming an edge is not repeated in the stream. Real graph streams however, are almost always multigraphs i.e., they contain many duplicate edges. The assumption of no repeated edges requires an extra pass *storing all the edges* just for deduplication, which defeats the purpose of small memory algorithms. We describe an algorithm for estimating the triangle count of a multigraph stream of edges. We show that all previous streaming algorithms for triangle counting fail for multigraph streams, despite their impressive accuracies for simple graphs. The bias created by duplicate edges is a major problem, and leads these algorithms astray. Our algorithm avoids these biases through careful debiasing strategies and has provable theoretical guarantees and excellent empirical performance. Our algorithm builds on the previously introduced wedge sampling methodology. Another challenge in analyzing temporal graphs is finding the right temporal window size. Our algorithm seamlessly handles multiple time windows, and does not require committing to any window size(s) a priori. We apply our algorithm to discover fascinating transitivity and triangle trends in real-world graph streams.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。