NDLI: Efficient algorithms for large-scale local triangle counting

Please wait, while we are loading the content...

Efficient algorithms for large-scale local triangle counting

Content Provider	ACM Digital Library
Author	Boldi, Paolo Castillo, Carlos Becchetti, Luca Gionis, Aristides
Copyright Year	2010
Abstract	In this article, we study the problem of approximate local triangle counting in large graphs. Namely, given a large graph $\textit{G}=(\textit{V,E})$ we want to estimate as accurately as possible the number of triangles incident to every node $\textit{v}∈$ $\textit{V}$ in the graph. We consider the question both for undirected and directed graphs. The problem of computing the $\textit{global}$ number of triangles in a graph has been considered before, but to our knowledge this is the first contribution that addresses the problem of approximate $\textit{local}$ triangle counting with a focus on the efficiency issues arising in massive graphs and that also considers the directed case. The distribution of the local number of triangles and the related local clustering coefficient can be used in many interesting applications. For example, we show that the measures we compute can help detect the presence of spamming activity in large-scale Web graphs, as well as to provide useful features for content quality assessment in social networks. For computing the local number of triangles (undirected and directed), we propose two approximation algorithms, which are based on the idea of min-wise independent permutations [Broder et al. 1998]. Our algorithms operate in a semi-streaming fashion, using $\textit{O}(\|\textit{V}\|)$ space in main memory and performing $\textit{O}(log$ $\|\textit{V}\|)$ sequential scans over the edges of the graph. The first algorithm we describe in this article also uses $\textit{O}(\|\textit{E}\|)$ space of external memory during computation, while the second algorithm uses only main memory. We present the theoretical analysis as well as experimental results on large graphs, demonstrating the practical efficiency of our approach.
Starting Page	1
Ending Page	28
Page Count	28
File Format	PDF
ISSN	15564681
e-ISSN	1556472X
DOI	10.1145/1839490.1839494
Volume Number	4
Issue Number	3
Journal	ACM Transactions on Knowledge Discovery from Data (TKDD)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-10-22
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Clustering coefficient Web computing Massive-graph computing Social networks
Content Type	Text
Resource Type	Article
Subject	Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A.: Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs (2008)

Triangle listing in massive networks

PATRIC: a parallel algorithm for counting triangles in massive networks

Counting Triangles in Massive Graphs with MapReduce

On the streaming complexity of computing local clustering coefficients

Triangle listing in massive networks and its applications

COUNTING TRIANGLES IN MASSIVE GRAPHS WITH MAPREDUCE (2013)

Efficient algorithms for large-scale local triangle counting (2010).

A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox

Efficient algorithms for large-scale local triangle counting

Similar Documents

A.: Efficient Semi-Streaming Algorithms for Local Triangle Counting in Massive Graphs (2008)

Triangle listing in massive networks

PATRIC: a parallel algorithm for counting triangles in massive networks

Counting Triangles in Massive Graphs with MapReduce

On the streaming complexity of computing local clustering coefficients

Triangle listing in massive networks and its applications

COUNTING TRIANGLES IN MASSIVE GRAPHS WITH MAPREDUCE (2013)

Efficient algorithms for large-scale local triangle counting (2010).

A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox

Efficient algorithms for large-scale local triangle counting