On the streaming complexity of computing local clustering coefficients

WSDM 2013 - Proceedings of the 6th ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2013, Pages 677-685

  Kutzkov, Konstantin ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

graph algorithms; local clustering coefficient; streaming; triangle counting

Indexed keywords

CLUSTERING COEFFICIENT; GRAPH ALGORITHMS; IMPOSSIBILITY RESULTS; LOCAL CLUSTERING; LOWER BOUNDS; NUMBER OF TRIANGLES; ONE-PASS; SPACE REQUIREMENTS; STREAMING ALGORITHM; TRIANGLE COUNTING; WEB MINING;

ACOUSTIC STREAMING; ALGORITHMS; DATA MINING; ESTIMATION; INFORMATION RETRIEVAL; LARGE SCALE SYSTEMS; WEBSITES;

GRAPH THEORY;

EID: 84874280026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2433396.2433480     Document Type: Conference Paper

References (33)

1. K. J. Ahn, S. Guha, A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. PODS 2012: 5-14
2. R. Albert, A.-L. Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47-97 (2002)
3. N. Alon, R. Yuster, U. Zwick. Finding and Counting Given Length Cycles. Algorithmica 17(3): 209-223 (1997)
4. H. Avron. Counting triangles in large graphs using randomized matrix trace estimation. Large-Scale Data Mining: Theory and Applications (KDD Workshop), 2010.
5. Z. Bar-Yossef, R. Kumar, D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632
6. L. Becchetti, P. Boldi, C. Castillo, A. Gionis. Efficient algorithms for large-scale local triangle counting. TKDD 4(3): (2010)
7. I. Bordino, D. Donato, A. Gionis, S. Leonardi. Mining Large Networks with Subgraph Counting. ICDM 2008: 737-742
8. A. Z. Broder, M. Charikar, A. M. Frieze, M. Mitzenmacher. Min-Wise Independent Permutations. STOC 1998: 327-336
9. L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, C. Sohler. Counting triangles in data streams. PODS 2006: 253-262
10. L. S. Buriol, G. Frahling, S. Leonardi, C. Sohler. Estimating Clustering Indexes in Data Streams. ESA 2007: 618-632
11. J. S. Coleman. Social capital in the creation of human capital. American Journal of Sociology, 94: 95-120, 1988
12. D. Coppersmith, R. Kumar. An improved data stream algorithm for frequency moments. SODA 2004: 151-156
13. J.-P. Eckmann and E. Moses. Curvature of co-links uncovers hidden thematic layers in the world wide web. PNAS, 99(9):5825-5829, 2002. (Pubitemid 34493224)
14. P. Erdös, and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 17-61, 1960
15. G. Feigenblat, E. Porat, A. Shiftan. Exponential time improvement for min-wise based algorithms. Inf. Comput. 209(4): 737-747 (2011)
16. H. Jowhari, M. Ghodsi. New Streaming Algorithms for Counting Triangles in Graphs. COCOON 2005: 710-716
17. H. Jowhari, M. Saglam, G. Tardos. Tight bounds for Lp samplers, finding duplicates in streams, and related problems. PODS 2011: 49-58
18. M. Kaiser. Mean clustering coefficients: the role of isolated nodes and leafs on clustering measures for small-world networks. New J. Phys. 10, 2008.
19. B. Kalyanasundaram, G. Schnitger. The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discrete Math. 5(4): 545-557 (1992)
20. R. M. Karp, S. Shenker, C. H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28: 51-55 (2003)
21. M. N. Kolountzakis, G. L. Miller, R. Peng, C. E. Tsourakakis. Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. Internet Mathematics, to appear
22. R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins. Trawling the Web for Emerging Cyber-Communities. Computer Networks 31(11-16): 1481-1493 (1999)
23. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003
24. R. Pagh, C. E. Tsourakakis. Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. 112(7): 277-281 (2012)
25. A. Portes. Social capital: Its origins and applications in modern sociology. Annual Review of Sociology, 24(1):1-24, 1998.
26. T. Schank, D. Wagner. Approximating Clustering Coefficient and Transitivity. J. Graph Algorithms Appl. 9(2): 265-275 (2005)
27. C. E. Tsourakakis. Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. ICDM 2008: 608-617
28. C. E. Tsourakakis, U. Kang, G. L. Miller, C. Faloutsos. DOULION: counting triangles in massive graphs with a coin. KDD 2009: 837-846
29. C. E. Tsourakakis, M. N. Kolountzakis, G. L. Miller. Triangle Sparsifiers. J. of Graph Algorithms and Appl. 15(6): 703-726 (2011)
30. V. Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. STOC 2012, 887-898
31. J. S. Vitter. Random Sampling with a Reservoir. ACM Trans. Math. Softw. 11(1): 37-57 (1985)
32. D. J. Watts, S. H. Strogatz. Collective dynamics of "small world" networks. Nature, 393: 440-442, 1998.
33. S. Zhang. Streaming Algorithms Measured in Terms of the Computed Quantity. COCOON 2007: 338-348