A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams
[article]
2021
arXiv
pre-print
Given a graph stream, how can we estimate the number of triangles in it using multiple machines with limited storage? Specifically, how should edges be processed and sampled across the machines for rapid and accurate estimation? The count of triangles (i.e., cliques of size three) has proven useful in numerous applications, including anomaly detection, community detection, and link recommendation. For triangle counting in large and dynamic graphs, recent work has focused largely on streaming
arXiv:1802.04249v5
fatcat:w7u3c3t7ezax3hlgclsptmj42u