Ju l 2 01 7 On Approximating the Number of k-cliques in Sublinear Time Talya Eden

@inproceedings{Ron2017JuL2,
  title={Ju l 2 01 7 On Approximating the Number of k-cliques in Sublinear Time Talya Eden},
  author={Dana Ron and C. Seshadhri},
  year={2017}
}
We study the problem of approximating the number of k-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let n denote the number of vertices in the graph, m the number of edges, and Ck the number of k-cliques. We design an algorithm that outputs a (1 + ǫ)-approximation (with high probability) for Ck, whose expected query complexity and running time are O ( n C 1/k k… CONTINUE READING