# Counting Triangles in Massive Graphs with MapReduce

### Abstract

Graphs and networks are used to model interactions in a variety of contexts. There is a growing need to quickly assess the characteristics of a graph in order to understand its underlying structure. Some of the most useful metrics are triangle-based and give a measure of the connectedness of mutual friends. This is often summarized in terms of clustering coefficients, which measure the likelihood that two neighbors of a node are themselves connected. Computing these measures exactly for large-scale networks is prohibitively expensive in both memory and time. However, a recent wedge sampling algorithm has proved successful in efficiently and accurately estimating clustering coefficients. In this paper, we describe how to implement this approach in MapReduce to deal with extremely massive graphs. We show results on publicly-available networks, the largest of which is 132M nodes and 4.7B edges, as well as artificially generated networks (using the Graph500 benchmark), the largest of which has 240M nodes and 8.5B edges. We can estimate the clustering coefficient by degree bin (e.g., we use exponential binning) and the number of triangles per bin, as well as the global clustering coefficient and total number of triangles, in an average of 0.33 sec. per million edges plus overhead (approximately 225 sec. total for our configuration). The technique can also be used to study triangle statistics such as the ratio of the highest and lowest degree, and we highlight differences between social and non-social networks. To the best of our knowledge, these are the largest triangle-based graph computations published to date.

Type
Publication
SIAM Journal on Scientific Computing
Date
Tags
Citation
T. G. Kolda, A. Pinar, T. Plantenga, C. Seshadhri, C. Task. Counting Triangles in Massive Graphs with MapReduce. SIAM Journal on Scientific Computing (Special Section on Two Themes: Planet Earth and Big Data), Vol. 36, No. 5, pp. S44-S77, 30 pages, 2014. https://doi.org/10.1137/13090729X

### Keywords

triangle counting, clustering coefficient, triangle characteristics, large-scale networks, MapReduce

### BibTeX

@article{KoPiPlSeTa14,
author = {Tamara G. Kolda and Ali Pinar and Todd Plantenga and C. Seshadhri and Christine Task},
title = {Counting Triangles in Massive Graphs with {MapReduce}},
journal = {SIAM Journal on Scientific Computing},
issuetitle = {Special Section on Two Themes: Planet Earth and Big Data},
volume = {36},
number = {5},
pages = {S44-S77},
pagetotal = {30}
month = {October},
year = {2014},
doi = {10.1137/13090729X},
}