Counting and Sampling Triangles from a Graph Stream

We present a new space-efficient method for counting and sampling triangles, and more generally, constant-sized cliques, in a massive graph whose edges arrive as a stream. When compared with prior work, our method yields significant improvements in the space complexity for these fundamental problems. This algorithm is extremely simple and easy to implement, and our experiments show very good practical performance on large graphs. We complement our triangle counting algorithm with a lower bound showing that the space complexity is close to optimal. We present extensions for the case of time-decay and multigraph streams.

By: A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu

Published in: RC25339 in 2012


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .