Fast Counting of Triangles in Large Real Networks : Algorithms and Laws

How can we quickly find the number of triangles in a large graph, without actually counting them? Triangles are important for real world social networks, lying at the heart of the clustering coefficient and of the transitivity ratio. However, straight-forward and even approximate counting algorithms can be slow, trying to execute or approximate the equivalent of a 3-way database join. In this paper, we provide two algorithms, the EigenTriangle for counting the total number of triangles in a graph, and the EigenTriangleLocal algorithm that gives the count of triangles that contain a desired node. Additional contributions include the following: (a) We show that both algorithms achieve excellent accuracy, with up to ≈ 1000x faster execution time, on several, real graphs and (b) we discover two new power laws ( Degree-Triangle and TriangleParticipation laws) with surprising properties.

[1]  F. Harary,et al.  The spectral approach to determining the number of walks in a graph , 1979 .

[2]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[3]  J. Cullum,et al.  Lanczos algorithms for large symmetric eigenvalue computations , 1985 .

[4]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[5]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[6]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[7]  A. Barabasi,et al.  Spectra of "real-world" graphs: beyond the semicircle law. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[9]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[10]  F. Chung,et al.  Eigenvalues of Random Power law Graphs , 2003 .

[11]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[12]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[13]  Ping Ye,et al.  Commensurate distances and similar motifs in genetic congruence and protein interaction networks in yeast , 2005, BMC Bioinformatics.

[14]  Christos Faloutsos,et al.  Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication , 2005, PKDD.

[15]  Christian Sohler,et al.  Counting triangles in data streams , 2006, PODS.

[16]  Ernesto Estrada,et al.  Spectral scaling and good expansion properties in complex networks , 2006, Europhysics Letters (EPL).

[17]  Nathaniel E. Helwig,et al.  An Introduction to Linear Algebra , 2006 .

[18]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[19]  Matthieu Latapy.  Practical algorithms for triangle computations in very large ( sparse ( power-law ) ) graphs , 2007 .

[20]  Christos Faloutsos,et al.  Scalable modeling of real graphs using Kronecker multiplication , 2007, ICML '07.

[21]  Luca Becchetti,et al.  Efficient semi-streaming algorithms for local triangle counting in massive graphs , 2008, KDD.

[22]  U. Feige,et al.  Spectral Graph Theory , 2015 .