Triangle Estimation Using Tripartite Independent Set Queries

Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an approximate triangle counting algorithm using only polylogarithmic queries when the number of triangles on any edge in the graph is polylogarithmically bounded. Our query oracle Tripartite Independent Set (TIS) takes three disjoint sets of vertices A, B and C as input, and answers whether there exists a triangle having one endpoint in each of these three sets. Our query model generally belongs to the class of group queries (Ron and Tsur, ACM ToCT, 2016; Dell and Lapinskas, STOC 2018) and in particular is inspired by the Bipartite Independent Set (BIS) query oracle of Beame et al. (ITCS 2018). We extend the algorithmic framework of Beame et al., with TIS replacing BIS, for triangle counting using ideas from color coding due to Alon et al. (J. ACM, 1995) and a concentration inequality for sums of random variables with bounded dependency (Janson, Rand. Struct. Alg., 2004).

[1]  Dana Ron,et al.  Approximately Counting Triangles in Sublinear Time , 2017, SIAM J. Comput..

[2]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[3]  Eric Price,et al.  A Hybrid Sampling Scheme for Triangle Counting , 2016, SODA.

[4]  Dana Ron,et al.  On approximating the number of k-cliques in sublinear time , 2017, STOC.

[5]  Dana Ron,et al.  The Power of an Example , 2014, ACM Trans. Comput. Theory.

[6]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[7]  Larry J. Stockmeyer,et al.  The complexity of approximate counting , 1983, STOC.

[8]  Jeong Han Kim,et al.  Optimal query complexity bounds for finding graphs , 2010, Artif. Intell..

[9]  Cyrus Rashtchian,et al.  Edge Estimation with Independent Set Oracles , 2017, ITCS.

[10]  Svante Janson,et al.  Large deviations for sums of partly dependent random variables , 2004 .

[11]  Mohammad Ghodsi,et al.  New Streaming Algorithms for Counting Triangles in Graphs , 2005, COCOON.

[12]  Sudipto Guha,et al.  Graph sketches: sparsification, spanners, and subgraphs , 2012, PODS.

[13]  Uriel Feige,et al.  On sums of independent random variables with unbounded variance, and estimating the average degree in a graph , 2004, STOC '04.

[14]  Dana Ron,et al.  Approximating average parameters of graphs , 2008, Random Struct. Algorithms.

[15]  Srikanta Tirthapura,et al.  Parallel triangle counting in massive streaming graphs , 2013, CIKM.

[16]  Ramana Rao Kompella,et al.  Graph sample and hold: a framework for big-graph analytics , 2014, KDD.

[17]  S. Matthew Weinberg,et al.  Computing Exact Minimum Cuts Without Knowing the Graph , 2017, ITCS.

[18]  Holger Dell,et al.  Fine-grained reductions from approximate counting to decision , 2017, STOC.

[19]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[20]  Devdatt P. Dubhashi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms: Contents , 2009 .

[21]  Dana Ron,et al.  Counting stars and other small subgraphs in sublinear time , 2010, SODA '10.

[22]  Thomas Sauerwald,et al.  Counting Arbitrary Subgraphs in Data Streams , 2012, ICALP.

[23]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[24]  Kitty Meeks,et al.  Approximately counting and sampling small witnesses using a colourful decision oracle , 2019, SODA.

[25]  Christian Sohler,et al.  Counting triangles in data streams , 2006, PODS.

[26]  Graham Cormode,et al.  A second look at counting triangles in graph streams (corrected) , 2017, Theor. Comput. Sci..

[27]  Saket Saurabh,et al.  Parameterized Query Complexity of Hitting Set using Stability of Sunflowers , 2018, ISAAC.

[28]  Arijit Ghosh,et al.  Hyperedge Estimation using Polylogarithmic Subset Queries , 2019, ArXiv.

[29]  Kun-Lung Wu,et al.  Counting and Sampling Triangles from a Graph Stream , 2013, Proc. VLDB Endow..