Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation

Social Network Analysis and Mining

Volumn 1, Issue 2, 2011, Pages 75-81

  Tsourakakis, Charalampos E ^a   Drineas, Petros ^b   Michelakis, Eirinaios ^c   Koutis, Ioannis ^a   Faloutsos, Christos ^a  

^a Carnegie Mellon University   (United States)

^b Rensselaer Polytechnic Institute   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING COEFFICIENT; NUMBER OF TRIANGLES; ON-LINE SOCIAL NETWORKS; POWER-LAW NETWORKS; REAL-WORLD GRAPHS; SPARSIFICATION; SPECTRAL PROPERTIES; TRIANGLE DENSITY;

SOCIAL NETWORKING (ONLINE);

EID: 84947214764     PISSN: 18695450     EISSN: 18695469     Source Type: Journal    
DOI: 10.1007/s13278-010-0001-9     Document Type: Article

References (29)

1. Achlioptas D, McSherry F (2001) Fast computation of low rank matrix approximation. In: Proceedings of 33rd STOC. ACM Press, New York
2. Alon N, Matias Y, Szegedy M (1996) The space complexity of approximating the frequency moments. In: STOC ’96: proceedings of the twenty-eighth annual ACM symposium on theory of computing, New York, NY, USA. ACM, New York, pp 20–29
3. Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17(3):209–223
4. Alon N, Gibbons PB, Matias Y, Szegedy M (2002) Tracking join and self-join sizes in limited storage, pp 10–20
5. Bar-Yosseff Z, Kumar R, Sivakumar D (2002) Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA ’02: proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp 623–632
6. Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of ACM KDD, Las Vegas, NV, USA
7. Buriol LS, Frahling G, Leonardi S, Marchetti-Spaccamela A, Sohler C (2006) Counting triangles in data streams. In: PODS ’06: proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, New York, NY, USA. ACM, pp 253–262
8. Chung F, Lu L, Vu V (2003) Eigenvalues of random power law graphs. Ann Comb 7(1):21–33
9. Coppersmith D, Winograd S (1987) Matrix multiplication via arithmetic progressions. In: STOC ’87: proceedings of the nineteenth annual ACM conference on theory of computing, New York, NY, USA. ACM, pp 1–6
10. Deerwester S, Dumais ST, Furnas GW, Landauer TK, Harshman R (1990) Indexing by latent semantic analysis. J Am Soc Inf Sci 41:391–407
11. Demmel J (1997) Applied numerical linear algebra. SIAM, Philadelphia
12. Drineas P, Kannan R (2003) Pass efficient algorithms for approximating large matrices. In: SODA ’03: proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp 223–232
13. Eckmann J-P, Moses E (2002) Curvature of co-links uncovers hidden thematic layers in the world wide web. PNAS 99(9):5825–5829
14. Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: SIGCOMM, pp 251–262
15. Farkas IJ, Derenyi I, Barabasi A-L, Vicsek T (2001) Spectra of “real-world” graphs: beyond the semi-circle law. Phys Rev E 64:1
16. Frieze A, Kannan R, Vempala S (1998) Fast Monte-Carlo algorithms for finding low-rank approximations. In: Proceedings of the 39th annual IEEE symposium on foundations of computer science, pp 370–378
17. Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss MJ (2003) One-pass wavelet decompositions of data streams. IEEE TKDE 15:2003
18. Golub G, Van Loan C (1989) Matrix computations, 2nd edn. Johns Hopkins Press, Baltimore
19. Latapy M (2008) Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor Comput Sci 407(1–3):458–473
20. Liben-Nowell D (2005) An algorithmic approach to social networks. PhD thesis, Massachusetts Institute of Technology, Electrical Engineering and Computer Science Department, June 2005
21. Mihail M, Papadimitriou C (2002) On the eigenvalue power law. In: Lecture notes on computer sciences, vol 2483. Springer, Berlin
22. Newman MEJ (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64:016131
23. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256
24. Schank T, Wagner D (2004) DELIS-TR-0043—finding, counting and listing all triangles in large graphs, an experimental study. Techreport 0043
25. Tsourakakis C (2008) Fast counting of triangles in large real networks, without counting: algorithms and laws. In: ICDM
26. Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009a) Doulion: counting triangles in massive graphs with a coin. In: Elder JF, Fogelman-Souli F, Flach PA, Zaki M (eds) Proceedings of KDD. ACM, pp 837–846
27. Tsourakakis CE, Kolountzakis MN, Miller GL (2009b) Approximate triangle counting. CoRR, abs/0904.3761
28. Turk M, Pentland A (1991) Eigenfaces for recognition. J Cogn Neurosci 3(1):71–86
29. Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge