Efficient Triangle Counting In Large Graphs Via Degree-Based Vertex Partitioning

Internet Mathematics

Volumn 8, Issue 1-2, 2012, Pages 161-185

  Kolountzakis, Mihail N ^a   Miller, Gary L ^b   Peng, Richard ^b   Tsourakakis, Charalampos E ^c  

^a UNIVERSITY OF CRETE   (Greece)

^b Carnegie Mellon University   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880315451     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2012.625260     Document Type: Article

References (59)

1. B. Abrego, S. Fernandez-Merchant, M Neubauer, and W. Watkins. “Sum of Squares of Degrees in a Graph.” Journal of Inequalities in Pure and Applied Mathematics 10 (2009), ART 64.
2. R. Ahlswede and G. O. H. Katona. “Graphs with Maximal Number of Adjacent Pairs of Edges.” Acta Mathematica Academiae Scientarium Hungaricae 32 (1978), 97–120.
3. N. Alon, M. Yossi, and M. Szegedy. “The Space Complexity of Approximating the Frequency Moments.” In ACM Symposium on Theory of Computing, 1996.
4. N. Alon, R. Yuster, and U. Zwick. “Finding and Counting Given Length Cycles.” Algorithmica 17:3 (1997), 209–223.
5. H. Avron. “Counting Triangles in Large Graphs Using Randomized Matrix Trace Estimation.” In Workshop on Large-Scale Data Mining: Theory and Applications, 2010.
6. Z. Bar-Yosseff, R. Kumar, and D. Sivakumar. “Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs.” In ACM–SIAM Symposium on Discrete Algorithms, 2010.
7. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. “Efficient Semistreaming Algorithms for Local Triangle Counting in Massive Graphs.” In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2008.
8. J. W. Berry, B. Hendrickson, R. LaViolette, and C. A. Phillips. “Tolerating the Community Detection Resolution Limit with Edge Weighting.” Physical Review E 83:5 (2011), 056119-1–056119-9.
9. S. Bhamidi, G. Bresler, and A. Sly. “Mixing Time of Exponential Random Graphs.” In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 803–812, 2008.
10. A. Bonato, N. Hadi, P. Horn, P. Pralat, and C. Wang. “Models of Online Social Networks.” Internet Mathematics 6:3 (2009), 285–313.
11. A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. “Minwise Independent Permutations.” In ACM Symposium on Theory of Computing, 1998.
12. L. Buriol, G. Frahling, S. Leonardi, A Marchetti Spaccamela and C. Sohler. “Counting Triangles in Data Streams.” In Symposium on Principles of Database Systems, 2006.
13. H. Chernoff. “A Note on an Inequality Involving the Normal Distribution.” Annals of Probability 9:3 (1981), 533–535.
14. N. Chiba and T. Nishizeki. “Arboricity and Subgraph Listing Algorithms.” SIAM Journal on Computing 14:1 (1985), 210–223.
15. F. Chung Graham and L. Lu. “Complex Graphs and Networks.” Providence: American Mathematical Society, 2006.
16. F. Chung Graham, L. Lu, and V. Vu. “The Spectra of Random Graphs with Given Expected Degrees.” In Proceedings of the National Academy of Sciences of the United States of America 100:11 (2003), 6313–6318.
17. D. Coppersmith and S. Winograd. “Matrix multiplication via arithmetic progressions.” In ACM Symposium on Theory of Computing, 1987.
18. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. “Clustering in Large Graphs and Matrices.” In ACM Symposium on Discrete Algorithms, 1999.
19. 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 (2002), 5825–5829.
20. O. Frank and D. Strauss. “Markov Graphs.” Journal of the American Statistical Association 81:395 (1986), 832–842.
21. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. “On Graph Problems in a Semi-streaming Model.” Journal of Theoretical Computer Science 348:2 (2005), 207–216.
22. I. Fudos and C. Hoffman. “A Graph-Constructive Approach to Solving Systems of Geometric Constraints.” ACM Trans. Graph. 16 (1997), 179–216.
23. A. Hajnal and E. Szemeredi. “Proof of a Conjecture of Erd˝os.” Combinatorial Theory and Its Applications 2 (1970), 601–623.
24. F. Heider. “Attitudes and Cognitive Organization.” Journal of Psychology 21 (1946), 107–112.
25. A. Itai and M. Rodeh. “Finding a Minimum Circuit in a Graph.” In ACM Symposium on Theory of Computing, 1977.
26. D. Jeffrey and S. Ghemawat. “MapReduce: Simplified Data Processing on Large Clusters.” Operating Systems Design and Implementation 51:3 (2004), 107–113.
27. S. Johnson and J. Lindenstrauss. “Extensions of Lipschitz Mappings into a Hilbert Space.” Contemporary Mathematics 26 (1984), 189–206.
28. H. Jowhari and M. Ghodsi. “New Streaming Algorithms for Counting Triangles in Graphs.” In Computing and Combinatorics, 710–716, 2005.
29. U. Kang, C. Tsourakakis, and C. Faloutsos. “PEGASUS: A Peta-scale Graph Mining System.” In International Conference on Data Mining, 2009.
30. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. “Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations.” SIAM Data Mining 548–558, 2010.
31. J. H. Kim and V. H. Vu. “Concentration of Multivariate Polynomials and Its Applications.” Combinatorica 20:3 (2000), 417–434.
32. M. N. Kolountakis, G. L. Miller, R. Peng, and C. E. Tsourakakis. “Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.” In Workshop on Algorithms and Models for the Web Graph, 2010.
33. D. Knuth. Seminumerical Algorithms, 3rd edition. Reading, MA: Addison- Wesley Professional, 1997.
34. M. Latapy. “Main-Memory Triangle Computations for Very Large (Sparse (Power-Law)) Graphs.” Theoretical Computer Science 407 (2008), 458–473.
35. J. Leskovec, D. Huttenlocher, and J. Kleinberg. “Predicting Positive and Negative Links in Online Social Networks.” In International Conference on World Wide Web, pp. 641–650, 2010.
36. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. “Microscopic Evolution of Social Networks.” In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 462–470, 2008.
37. S. Li, C. M. Armstrong, N. Bertin, H. Ge., et al. “A Map of the Interactome Network of the Metazoan C. elegans.” Science 303 (2004), 540–543.
38. A. Magen and A. Zouzias. “Near Optimal Dimensionality Reductions That Preserve Volumes.” In Randomization and Approximation Techniques in Computer Science, 523–534, 2008.
39. A. Mislove, M. Massimiliano, K. Gummadi, P. Druschel, and B. Bhattacharjee. “Measurement and Analysis of Online Social Networks.” In Internet Measurement Conference, 2007.
40. M. Newman. “The Structure and Function of Complex Networks.” SIAM Review 45:2 (2003), 167–256.
41. M. E. J. Newman, D. J. Watts, and S. Strogatz. “Random Graph Models of Social Networks.” Proceedings of the National Academy of Sciences of the United States of America 99 (2002), 2566–2572.
42. C. Pagh and C. E. Tsourakakis. “Colorful Triangle Counting and a MapReduce Implementation.” Information Processing Letters 112:7 (2012), 227–281.
43. C. Papadimitriou and M. Yannakakis. “The Clique Problem for Planar Graphs.” Information Processing Letters 13 (1981), 131–133.
44. G Robins, P. Pattison, Y. Kalish, and D. Lusher. “An Introduction to Exponential Random Graph (p*) Models for Social Networks.” Social Networks Journal, Special Section: Advances in Exponential Random Graph (p*) Models 29 (2007), 173–191.
45. J. Rougemont and P. Hingamp. “DNA Microarray Data and Contextual Analysis of Correlation Graphs.” BMC Bioinformatics 4 (2003), 4–15.
46. T. Schank and D. Wagner. “Finding, Counting and Listing All Triangles in Large Graphs: An Experimental Study.” In Workshop on Experimental and Efficient Algorithms, 2005.
47. T. Schank and D. Wagner. “Approximating Clustering Coefficient and Transitivity.” Journal of Graph Algorithms and Applications 9 (2005), 265–275.
48. C. E. Tsourakakis. “Fast Counting of Triangles in Large Real Networks, without Counting: Algorithms and Laws.” In International Conference on Data Mining, 2008.
49. C. E. Tsourakakis. “Counting Triangles Using Projections.” Knowledge and Information Systems 26:3 (2011), 501–520.
50. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. “Doulion: Counting Triangles in Massive Graphs with a Coin.” In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2009.
51. 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.” Advances in Social Networks Analysis and Mining (2010).
52. C. E. Tsourakakis, M. Kolountzakis, and G. L. Miller. “Triangle Sparsifiers.” Journal of Graph Algorithms and Applications 15:6 (2011), 703–726.
53. V. H. Vu. “On the Concentration of Multivariate Polynomials with Small Expectation.” Random Structures and Algorithms 16 (2000), 344–363.
54. S. Wasserman and K. Faust. “Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences).” Cambridge UK: Cambridge University Press, 1994.
55. S. Wasserman and P. Pattison. “Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and p*.” Psychometrika 61 (1996), 401–425.
56. D. Watts and S. Strogatz. “Collective Dynamics of Small- World Networks.” Nature 393 (1998), 440–442.
57. H. Wesler, E. Gleave, D. Fisher, and M. Smith. “Visualizing the Signatures of Social Roles in Online Discussion Groups.” Journal of Social Structure 8 (2007).
58. A. Wimmer and K. Lewis. “Beyond and Below Racial Homophily: ERG Models of a Friendship Network Documented on Facebook.” American Journal of Sociology 2 (2010), 583–642.
59. S. Yook, Z. Oltvai, and A. L. Barabasi. “Functional and Topological Characterization of Protein Interaction Networks.” Proteomics 4 (2004), 928–942.