Estimation of the number of cliques in a random graph

Authors:
Sonal Patel;Eric Harley
Affiliations:
Ryerson University, Toronto, ON, Canada;Ryerson University, Toronto, ON, Canada
Venue:
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Year:
2010

Citing 3
Cited 0

Trawling the Web for emerging cyber-communities

WWW '99 Proceedings of the eighth international conference on World Wide Web
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines methods for predicting and estimating the number of maximal cliques in a random graph. A clique is a subgraph where each vertex is connected to every other vertex in the subgraph. A maximal clique is a clique which is not a proper subgraph of another clique. There are many algorithms that enumerate all maximal cliques in a graph, but since the task can take exponential time, there are practical limits on the size of the input. In this paper, we examine three methods that could be used to estimate the number of cliques in a random graph. One method is based on sampling, another on probability arguments and the third uses curve fitting. We compare the methods for accuracy and efficiency.