Abstract Triangle counting is an important problem in graph mining. The clustering coefficient and the transitivity ratio, two commonly used measures effectively quantify the triangle density in order to quantify the fact that friends of friends tend to be friends themselves. Furthermore, several successful graph-mining applications rely on the number of triangles in the graph. In this paper, we study the problem of counting triangles in large, power-law networks. Our algorithm, SPARSIFYINGEIGENTRIANGLE, relies on the spectral properties of power-law networks and the Achlioptas-McSherry sparsification process. SPARSIFYING-EIGENTRIANGLE is easy to parallelize, fast, and accurate. We verify the validity of our approach with several experiments in real-world graphs, where we achieve at the same time high accuracy and considerable speedup versus a straight-forward exact counting competitor. Finally, our contributions include a simple method for making link recommendations in online social networks based on the number of triangles as well as a procedure for estimating triangles using sketches.
Recently, REF proposed a simple algorithm that for making link recommendations in online social networks by recommending those links that create as many triangles as possible.
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation
Social Network Analysis and Mining
Social Network Analysis and Mining
Mathematics Computer Science