TRIEST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size

Posted ON July 18, 2017

Authors: Matteo Riondato (Two Sigma), Lorenzo De Stefani, Alessandro Epasto, Eli Upfal

Published in: ACM Transactions on Knowledge Discovery from Data, 11(4):43:1–43:50

Abstract: We present TRIÈST, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) number of triangles in a fully-dynamic graph represented as an adversarial stream of edge insertions and deletions. Our algorithms use reservoir sampling and its variants to exploit the user-specified memory space at all times. This is in contrast with previous approaches, which require hard-to-choose parameters (e.g., a fixed sampling probability) and other no guarantees on the amount of memory they use. We analyze the variance of the estimations and show novel concentration bounds for these quantities. Our experimental results on very large graphs demonstrate that TRIÈST outperforms state-of-the-art approaches in accuracy and exhibits a small update time.

DOI: https://doi.org/10.1145/3059194

Related Articles

Life at Two Sigma

We’re rigorous about our work and developing our people.

Learn More

Interested in working at Two Sigma? Explore careers.

This website uses cookies to ensure you get the best experience on our website. Learn More
Got It