Wedge sampling for computing clustering coefficients and triangle counts on large graphs

Statistical Analysis and Data Mining

Volumn 7, Issue 4, 2014, Pages 294-307

  Seshadhri, C ^a   Pinar, Ali ^a   Kolda, Tamara G ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Clustering coefficients; Directed triangles; Triangle characteristics; Triangle counting; Wedge sampling

Indexed keywords

DIRECTED GRAPHS;

CLUSTERING COEFFICIENT; DIRECTED TRIANGLE; GRAPH METRICS; LARGE GRAPHS; LOCAL CLUSTERING; MODEL INTERACTION; SOCIAL COHESION; TRIANGLE CHARACTERISTIC; TRIANGLE COUNTING; WEDGE SAMPLING;

GRAPHIC METHODS;

EID: 84904330681     PISSN: 19321864     EISSN: 19321872     Source Type: Journal    
DOI: 10.1002/sam.11224     Document Type: Article

References (37)

1. C. Seshadhri, A. Pinar, and T. G. Kolda, Triadic measures on graphs: the power of wedge sampling, In SDM13: Proceedings of the 2013 SIAM International Conference on Data Mining, May 2013, Austin, Texas, 10-18.
2. R. S. Burt, Structural holes and good ideas, Am J Sociol 110(2) (2004), 349-399.
3. J. S. Coleman, Social capital in the creation of human capital, Am J Sociol 94 (1988), S95-S120.
4. B. Foucault Welles, A. Van Devender, and N. Contractor, Is a friend a friend?: Investigating the structure of friendship networks in virtual worlds, In: Proceedings of CHI-EA'10, Atlanta, Georgia, 2010, 4027-4032.
5. A. Portes, Social capital: its origins and applications in modern sociology, Annu Rev Sociol 24(1) (1998), 1-24.
6. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis, Efficient semi-streaming algorithms for local triangle counting in massive graphs, In Proceedings of KDD'08, Las Vegas, Nevada, 2008, 16-24.
7. J.-P. Eckmann and E. Moses, Curvature of co-links uncovers hidden thematic layers in the World Wide Web, PNAS 99(9) (2002), 5825-5829.
8. C. Seshadhri, T. G. Kolda, and A. Pinar, Community structure and scale-free collections of Erdös-Rényi graphs, Phys Rev E 85(5) (2012), 056109.
9. N. Durak, A. Pinar, T. G. Kolda, and C. Seshadhri, Degree relations of triangles in real-world networks and graph models, In Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM '12, New York, ACM, 2012, 1712-1716
10. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, Cambridge University Press, United Kingdom, 1994.
11. D. Watts and S. Strogatz, Collective dynamics of 'small-world' networks, Nature, 393 (1998), 440-442.
12. C. Seshadhri, A. Pinar, N. Durak, and T. G. Kolda, The importance of directed triangles with reciprocity: patterns and algorithms. arXiv:1302.6220, February 2013.
13. T. Schank and D. Wagner, Approximating clustering coefficient and transitivity, J Graph Alg Appl 9 (2005), 265-275.
14. N. Chiba and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J Comput 14 (1985), 210-223.
15. T. Schank and D. Wagner, Finding, counting and listing all triangles in large graphs, an experimental study, In Experimental and Efficient Algorithms, Berlin/Heidelberg, Springer, 2005, 606-609.
16. J. Cohen, Graph twiddling in a MapReduce world, Comput Sci Eng 11 (2009), 29-41.
17. S. Suri and S. Vassilvitskii, Counting triangles and the curse of the last reducer, In Proceedings of WWW'11, Hyderabad, India, 2011, 607-614.
18. J. W. Berry, L. Fosvedt, D. Nordman, C. A. Phillips, and A. G. Wilson, Listing triangles in expected linear time on power law graphs with exponent at least, Sandia National Laboratories, Technical Report SAND2010-4474C, 2011.
19. S. Chu and J. Cheng, Triangle listing in massive networks and its applications, In Proceedings of KDD'11, San Diego, CA, 2011, 672-680.
20. M. Latapy, Main-memory triangle computations for very large (sparse (power-law)) graphs, Theor Comput Sci 407 (2008), 458-473.
21. S. M. Arifuzzaman, M. Khan, and M. V. Marathe, PATRIC: A Parallel Algorithm for Counting Triangles and Computing Clustering Coefficients in Massive Networks, Network Dynamics and Simulation Science Laboratory, Virginia Polytechnic Institute and State University, NDSSL Technical Report 12-042, July 2012.
22. C. E. Tsourakakis, Fast counting of triangles in large real networks, without counting: algorithms and laws, In Proceedings of ICDM 2008, Pisa, Italy, 2008, 608-617.
23. H. Avron, Counting triangles in large graphs using randomized matrix trace estimation, In Proceedings of KDD-LDMTA'10, Washington, DC, 2010.
24. C. Tsourakakis, P. Drineas, E. Michelakis, I. Koutis, and C. Faloutsos, Spectral counting of triangles in power-law networks via element-wise sparsification, In Proceedings of ASONAM'09, Athens, Greece, 2009, 66-71.
25. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos, Doulion: counting triangles in massive graphs with a coin, In Proceedings of KDD '09, Paris, France, 2009, 837-846.
26. M. N. Kolountzakis, G. L. Miller, R. Peng, and C. Tsourakakis, Efficient triangle counting in large graphs via degree-based vertex partitioning, In Proceeddings of WAW'10, Stanford, CA, 2010.
27. R. Pagh and C. Tsourakakis, Colorful triangle counting and a mapreduce implementation, Inf Process Lett 112 (2012), 277-281.
28. C. Tsourakakis, M. N. Kolountzakis, and G. Miller, Triangle sparsifiers, J Graph Alg Appl 15 (2011), 703-726.
29. J.-H. Yoon and S.-R. Kim, Improved sampling for triangle counting with MapReduce, In Convergence and Hybrid Information Technology, Volume 6935 of Lecture Notes in Computer Science, G. Lee, D. Howard, and D. Slezak, eds. Berlin/Heidelberg, Springer, 2011, 685-689.
30. Z. Bar-Yossef, R. Kumar, and D. Sivakumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, In Proceedings of SODA'02, San Francisco, CA, 2002, 623-632.
31. L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler, Counting triangles in data streams, In Proceedings of PODS'06, Chicago, IL, 2006, 253-262.
32. H. Jowhari and M. Ghodsi, New streaming algorithms for counting triangles in graphs, In COCOON'05: Computing and Combinatorics, Volume 3595 of Lecture Notes in Computer Science, L. Wang, ed. Berlin, Heidelberg, Springer, 2005, 710-716.
33. T. G. Kolda, A. Pinar, T. Plantenga, C. Seshadhri, and C. Task, Counting triangles in massive graphs with MapReduce to appear in SIAM J. Scientific Computing, also available at. arXiv:1301.5887, January 2013.
34. M. Jha, C. Seshadhri, and A. Pinar, A space efficient streaming algorithm for triangle counting using the birthday paradox, In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '13, New York, ACM, 2013, 589-597.
35. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Am Stat Assoc 58 (1963), 13-30.
36. Stanford Network Analysis Project (SNAP). Available at URL: http://snap.stanford.edu/.
37. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, In Proceedings of IMC'07, ACM, San Diego, CA, 2007, 29-42.