Counting triangles in real-world networks using projections

Knowledge and Information Systems

Volumn 26, Issue 3, 2011, Pages 501-520

  Tsourakakis, Charalampos E ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Algorithms; Network analysis; SVD; Triangles

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; SINGULAR VALUE DECOMPOSITION; SOCIAL NETWORKING (ONLINE);

CLUSTERING COEFFICIENT; EXPONENTIAL RANDOM GRAPH MODEL; NUMBER OF TRIANGLES; ON-LINE SOCIAL NETWORKS; REAL-WORLD NETWORKS; SPECTRAL PROPERTIES; THEMATIC STRUCTURES; TRIANGLES;

GRAPH ALGORITHMS;

EID: 79951515353     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0291-2     Document Type: Article

References (47)

1. Achlioptas D, McSherry F (2001) Fast computation of low rank matrix approximations. Symp Theory Comput
2. Adamic L, Glance N (2005) The political blogosphere and the 2004 US election: divided they blog. Workshop Link Discov
3. Alon N, Matias Y, Szegedy M (1996) The space complexity of approximating the frequency moments. Symp Theory Comput
4. Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17(3):209-223
5. Bar-Yosseff Z, Kumar R, Sivakumar D (2002) Reductions in streaming algorithms, with an application to counting triangles in graphs. Symp Discrete Algorithms
6. Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. Knowl Discov Data Min
7. Bollobas B (2001) Random graphs. Cambridge University Press, Cambridge
8. Broder AZ, Charikar M, Frieze A, Mitzenmacher M (1998) Min-wise independent permutations. Symp Theory Comput
9. Buriol L, Frahling G, Leonardi S, Marchetti-Spaccamela A, Sohler C (2006) Counting triangles in data streams. Princc Database Syst
10. Chung F, Lu L, Vu V (2003) Eigenvalues of random power law graphs. Ann Comb 7:21-33
11. Clauset A, Shalizi CR, Newman MEJ (2009) Power-law distributions in empirical data. SIAM Rev 51(4)
12. Coppersmith D, Winograd S (1987) Matrix multiplication via arithmetic progressions. Symp Theory Comput
13. Cullum J, Willoughby RA (2002) Lanczos algorithms for large symmetric eigenvalue computations vol 1. Society for Industrial and Applied Mathematics, Philadelphia
14. Cuppen JJM (1981) A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer Math 36:177-195
15. Deerwester S, Dumais S, Furnas G, Landauer T, Harshman R (1990) Indexing by latent semantic analysis. J Am Soc Inf Sci 41(6):391-407
16. Demmel J (1997) Applied numerical linear algebra. Society for Industrial and Applied Mathematics, Philadelphia
17. Drineas P, Frieze A, Kannan R, Vempala S, Vinay V (2004) Clustering large graphs via the Singular Value Decomposition. Mach Learn J 04(56):9-33
18. Eckmann JP, Moses E (2002) Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Proc Natl Acad Sci (PNAS) 99(9):5825-5829
19. Edwards JT, Licciardello DC, Thouless DJ (1979) Use of Lanczos methos for finding complete sets of eigenvalues of large sparse symmetric matrices. IMA J Appl Math 23:277-283
20. Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationshipds of the internet topology. SIGCOMM
21. Farkas I, Derenyi I, Barabasi AL, Vicsek T (2001) Spectra of real-world graphs: beyond the semicircle law. Phys Rev E 64
22. Fienberg S, Rinaldo A, Zhou Y (2009) On the geometry of discrete exponential families with application to exponential random graph models. CMU Technical Report STAT-TR871
23. Furedi Z, Komlos J (1981) The eigenvalues of random symmetric matrices. J Comb 1(3):233-241
24. Godsil CD, Royle G (2001) Algebraic graph theory. Springer, Berlin
25. Golub GH, Van Loan CF (1989) Matrix computations. Johns Hopkins Press, Baltimore
26. Kang U, Tsourakakis C, Faloutsos C (2009) PEGASUS: a peta-scale graph mining system-implementation and observations. IEEE Int Conf Data Min, Available at http://www.cs.cmu.edu/~pegasus/
27. Kleinberg J (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604-632
28. LatapyM (2008) Practical algorithms for triangle computations in very large (sparse (power-law)) graphs. J Theor Comput Sci 407:458-473
29. Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2005) Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. Pract Knowl Discov Databases
30. Leskovec J, Faloutsos C (2007) Scalable modeling of real graphs using Kronecker multiplication. Int Conf Mach Learn
31. Leskovec J, Backstrom L, Kumar R, Tomkins A (2008) Microscopic evolution of networks. Knowl Discov Data Min
32. Meurant G (2006) The Lanczos and conjugate gradient algorithms, from theory to finite precision computations. Society for Industrial and Applied Mathematics, Philadelphia
33. Mihail M, Papadimitriou C (2002) The eigenvalue power law. RANDOM
34. Ove F, Strauss D (1986) Markov graph. J Am Stat Assoc 81:832-842
35. Papadimitriou C, Raghavan P, Tamaki H, Vempala S (1998) Latent semantic indexing: a probabilistic analysis. Princ Database Syst
36. Strang G (2003) Introduction to linear algebra. Society for Industrial and Applied Mathematics, Philadelphia
37. Schank T, Wagner D (2004) DELIS-TR-0043 finding, counting and listing all triangles in large graphs, an experimental study. Tech Report 0043
38. Schank T, Wagner D (2005) Approximating clustering coefficient and transitivity. J Graph Algorithms Appl 9:265-275
39. Song G, Cui B, Zheng B, Xie K, Yang D (2009) Accelerating sequence searching: dimensionality reduction method. Knowl Inf Syst 20:301-322
40. Tsourakakis C (2010) MACH: fast randomized tensor decompositions. SIAM Conf Data Min
41. Tsourakakis C (2008) Fast counting of triangles in large real networks without counting: algorithms and laws. IEEE Int Conf Data Min
42. Tsourakakis C, Kang U, Miller GL, Faloutsos C (2009) DOULION: counting triangles in massive graphs with a coin. Knowl Discov Data Min
43. Tsourakakis C, Kolountzakis M, Miller GL (2009) Approximate triangle counting. In Arxiv 0904.3761
44. Tsourakakis C, Drineas P, Michelakis E, Koutis I, Faloutsos C (2009) Spectral counting of triangles in power-law networks via element-wise sparsification. Adv Soc Netw Anal Min
45. Tsourakakis C, Drineas P, Michelakis E, Koutis I, Faloutsos C (2010) Spectral counting of triangles in power-law networks via element-wise sparsification and triangle-based link recommendation. Invited book chapter in advances in social networks analysis and mining (submitted)
46. Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge
47. Xiang S, Nie F, Song Y, Zhang C, Zhang C (2009) Embedding new data points for manifold learning via coordinate propagation. Knowl Inf Syst 19:159-184