Colorful Triangle Counting and a MapReduce Implementation

Details Colorful Triangle Counting and a MapReduce Implementation Colorful Triangle Counting and a MapReduce Implementation

2011-03-31

arxiv.org/abs/1103.6073v1

Computer Science

Data Structures and Algorithms

8 pages, 1 figure

Scientific paper

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, if $p \geq \max{(\frac{\Delta \log{n}}{t}, \frac{\log{n}}{\sqrt{t}})}$, where $n$, $t$, $\Delta$ denote the number of vertices in $G$, the number of triangles in $G$, the maximum number of triangles an edge of $G$ is contained, then for any constant $\epsilon>0$ our unbiased estimate $T$ is concentrated around its expectation, i.e., $ \Prob{|T - \Mean{T}| \geq \epsilon \Mean{T}} = o(1)$. Finally, we present a \textsc{MapReduce} implementation of our algorithm.

Affiliated with

Also associated with

No associations

Rating

Colorful Triangle Counting and a MapReduce Implementation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Colorful Triangle Counting and a MapReduce Implementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Colorful Triangle Counting and a MapReduce Implementation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244729