Independent Set Size Approximation in Graph Streams

We study the problem of estimating the size of independent sets in a graph $G$ defined by a stream of edges. Our approach relies on the Caro-Wei bound, which expresses the desired quantity in terms of a sum over nodes of the reciprocal of their degrees, denoted by $\beta(G)$. Our results show that $\beta(G)$ can be approximated accurately, based on a provided lower bound on $\beta$. Stronger results are possible when the edges are promised to arrive grouped by an incident node. In this setting, we obtain a value that is at most a logarithmic factor below the true value of $\beta$ and no more than the true independent set size. To justify the form of this bound, we also show an $\Omega(n/\beta)$ lower bound on any algorithm that approximates $\beta$ up to a constant factor.

[1]  Xiaoming Sun,et al.  Streaming and Communication Complexity of Clique Approximation , 2012, ICALP.

[2]  Dana Ron,et al.  A pr 2 01 6 Sublinear Time Estimation of Degree Distribution Moments : The Arboricity Connection ( Full Version ) Talya Eden , 2016 .

[3]  Yang Li,et al.  On Estimating Maximum Matching Size in Graph Streams , 2017, SODA.

[4]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[5]  Adi Rosén,et al.  Space-Constrained Interval Selection , 2012, ICALP.

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

[7]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[8]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[9]  Pablo Pérez-Lantero,et al.  Interval selection in the streaming model , 2015, Theor. Comput. Sci..

[10]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[11]  Ronitt Rubinfeld,et al.  Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation , 2016, ArXiv.

[12]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[13]  Ami Paz,et al.  A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model , 2017, SODA.

[14]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[15]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[16]  Magnús M. Halldórsson,et al.  Distributed Large Independent Sets in One Round on Bounded-Independence Graphs , 2015, DISC.

[17]  Jerrold R. Griggs.  Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.

[18]  Magnús M. Halldórsson,et al.  Streaming Algorithms for Independent Sets in Sparse Hypergraphs , 2016, Algorithmica.

[19]  Graham Cormode,et al.  The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs , 2016, ESA.

[20]  Andrew McGregor,et al.  Graph stream algorithms: a survey , 2014, SGMD.

[21]  Vladimir Braverman,et al.  Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums , 2014, APPROX-RANDOM.

[22]  Ami Paz,et al.  A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model , 2019, ACM Trans. Algorithms.