Random Walk

We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available …

Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying …