A space efficient streaming algorithm for triangle counting using the birthday paradox

@inproceedings{Jha2013ASE,
  title={A space efficient streaming algorithm for triangle counting using the birthday paradox},
  author={Madhav Jha and Seshadhri Comandur and Ali Pinar},
  booktitle={KDD},
  year={2013}
}
We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a stream of edges. Our procedure is based on the classic probabilistic result, the birthday paradox. When the transitivity is constant and there are more edges than wedges (common properties for social networks), we can prove that our algorithm requires O(√n) space (n is the number of vertices) to provide accurate… CONTINUE READING
Highly Cited
This paper has 93 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
65 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 65 extracted citations

93 Citations

0102030'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…