Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS

06/24/2020
by   Shweta Jain, et al.
0

Clique and near-clique counts are important graph properties with applications in graph generation, graph modeling, graph analytics, community detection among others. They are the archetypal examples of dense subgraphs. While there are several different definitions of near-cliques, most of them share the attribute that they are cliques that are missing a small number of edges. Clique counting is itself considered a challenging problem. Counting near-cliques is significantly harder more so since the search space for near-cliques is orders of magnitude larger than that of cliques. We give a formulation of a near-clique as a clique that is missing a constant number of edges. We exploit the fact that a near-clique contains a smaller clique, and use techniques for clique sampling to count near-cliques. This method allows us to count near-cliques with 1 or 2 missing edges, in graphs with tens of millions of edges. To the best of our knowledge, there was no known efficient method for this problem, and we obtain a 10x - 100x speedup over existing algorithms for counting near-cliques. Our main technique is a space-efficient adaptation of the Turán Shadow sampling approach, recently introduced by Jain and Seshadhri (WWW 2017). This approach constructs a large recursion tree (called the Turán Shadow) that represents cliques in a graph. We design a novel algorithm that builds an estimator for near-cliques, using an online, compact construction of the Turán Shadow.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2020

The Power of Pivoting for Exact Clique Counting

Clique counting is a fundamental task in network analysis, and even the ...
research
02/24/2020

Parallel Clique Counting and Peeling Algorithms

Dense subgraphs capture strong communities in social networks and entiti...
research
12/07/2022

DeMEtRIS: Counting (near)-Cliques by Crawling

We study the problem of approximately counting cliques and near cliques ...
research
12/21/2021

Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations

Counting instances of specific subgraphs in a larger graph is an importa...
research
08/28/2018

Enumerating Top-k Quasi-Cliques

Quasi-cliques are dense incomplete subgraphs of a graph that generalize ...
research
11/17/2019

Sparse Hopsets in Congested Clique

We give the first Congested Clique algorithm that computes a sparse hops...
research
09/04/2020

Faster motif counting via succinct color coding and adaptive sampling

We address the problem of computing the distribution of induced connecte...

Please sign up or login with your details

Forgot password? Click here to reset