Counting and sampling triangles from a graph stream

Proceedings of the VLDB Endowment

Volumn 6, Issue 14, 2013, Pages 1870-1881

  Pavan, A ^a   Tangwongsan, Kanat ^b   Tirthapura, Srikanta ^c   Wu, Kun Lung ^b  

^a Iowa State University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Iowa State University of Science and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH STRUCTURES;

COUNTING AND SAMPLINGS; LARGE GRAPHS; MASSIVE GRAPH; SPACE AND TIME COMPLEXITY; SPACE EFFICIENT ALGORITHMS;

GRAPH ALGORITHMS;

EID: 84889586922     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2556549.2556569     Document Type: Article

References (24)

1. K. J. Ahn, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In Proc. ACM Symposium on Principles of Database Systems (PODS), pages 5-14, 2012.
2. B. Babcock, M. Datar, and R. Motwani. Sampling from a moving window over streaming data. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 633-634, 2002.
3. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 623-632, 2002.
4. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD), pages 16-24, 2008.
5. L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler. Counting triangles in data streams. In Proc. ACM Symposium on Principles of Database Systems (PODS), pages 253-262, 2006.
6. L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler. Estimating clustering indexes in data streams. In Proc. European Symposium on Algorithms (ESA), pages 618-632, 2007.
7. J.-P. Eckmann and E. Moses. Curvature of co-links uncovers hidden thematic layers in the world wide web. Proceedings of the National Academy of Sciences, 99(9):5825-5829, 2002.
8. M. Jha, C. Seshadhri, and A. Pinar. From the birthday paradox to a practical sublinear space streaming algorithm for triangle counting. CoRR, abs/1212.2264, 2012.
9. H. Jowhari and M. Ghodsi. New streaming algorithms for counting triangles in graphs. In Proc. 11th Annual International Conference Computing and Combinatorics (COCOON), pages 710-716, 2005.
10. D. M. Kane, K. Mehlhorn, T. Sauerwald, and H. Sun. Counting arbitrary subgraphs in data streams. In Proc. International Colloquium on Automata, Languages, and Programming (ICALP), pages 598-609, 2012.
11. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
12. J. Leskovec. Stanford large network dataset collection. http://snap.stanford.edu/data/index.html. Accessed Dec 5, 2012.
13. M. Manjunath, K. Mehlhorn, K. Panagiotou, and H. Sun. Approximate counting of cycles in streams. In Proc. European Symposium on Algorithms (ESA), pages 677-688, 2011.
14. M. E. J. Newman. The structure and function of complex networks. SIAM REVIEW, 45:167-256, 2003.
15. M. E. J. Newman, D. J. Watts, and S. H. Strogatz. Random graph models of social networks. PNAS, 99(1):2566-2572, 2002.
16. R. Pagh and C. E. Tsourakakis. Colorful triangle counting and a mapreduce implementation. Inf. Process. Lett., 112(7):277-281, 2012.
17. T. Schank and D. Wagner. Approximating clustering coefficient and transitivity. Journal of Graph Algorithms and Applications, 9(2):265-275, 2005.
18. T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Workshop on Experimental and Efficient Algorithms (WEA), pages 606-609, 2005.
19. S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In Proc. 20th International Conference on World Wide Web (WWW), pages 607-614, 2011.
20. K. Tangwongsan, A. Pavan, and S. Tirthapura. Parallel triangle counting in massive streaming graphs. In CIKM, 2013.
21. C. E. Tsourakakis, P. Drineas, E. Michelakis, I. Koutis, and C. Faloutsos. Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Social Netw. Analys. Mining, 1(2):75-81, 2011.
22. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. Doulion: counting triangles in massive graphs with a coin. In Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 837-846, 2009.
23. S. Wasserman and K. Faust. Social Network Analysis. Cambridage University Press, 1994.
24. D. J. Watts and S. H. Strogatz. Collective dynamics of "small-world" networks. Nature, 393:440-442, 1998.