Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

We study the problem of estimating the value of sums of the form S[subscript p]≜∑([x[subscript i] over p]) when one has the ability to sample x[subscript i]≥0 with probability proportional to its magnitude. When p=2 , this problem is equivalent to estimating the selectivity of a self-join query in d...

Full description

Bibliographic Details
Main Authors: Aliakbarpour, Maryam (Contributor), Biswas, Amartya Shankha (Contributor), Gouleakis, Themistoklis (Contributor), Peebles, John Lee Thompson (Contributor), Yodpinyanee, Anak (Contributor), Rubinfeld, Ronitt (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer US, 2018-05-07T14:43:01Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items