47 citations · 102 across the 27 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2020★ 10 cited
Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS
Shweta Jain, C. Seshadhri
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…
cs.SI2017
Provable and practical approximations for the degree distribution using sublinear graph samples
Talya Eden, Shweta Jain, Ali Pinar +2
The degree distribution is one of the most fundamental properties used in the analysis of massive graphs. There is a large literature on graph sampling, where the goal is to estima…
cs.SI2016
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
Shweta Jain, C. Seshadhri
Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much atte…