SCIENCE@home

Colorful triangle counting and a MapReduce implementation

R. Pagh,Charalampos E. Tsourakakis

Published 2011 in Information Processing Letters

ABSTRACT

In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, let G be a graph with n vertices, t triangles and let @D be the maximum number of triangles an edge of G is contained in. Our randomized algorithm colors the vertices of G with N=1/p colors uniformly at random, counts monochromatic triangles, i.e., triangles whose vertices have the same color, and scales that count appropriately. We show that if p>=max(@Dlognt,lognt) then for any constant @e>0 our unbiased estimate T is concentrated around its expectation, i.e., Pr[|T-E[T]|>=@eE[T]]=o(1). Finally, our algorithm is amenable to being parallelized. We present a simple MapReduce implementation of our algorithm.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-28 of 28 references · Page 1 of 1

CITED BY

Showing 1-100 of 181 citing papers · Page 1 of 2

12
Next