Better Sum Estimation via Weighted Sampling

Given a large set U where each item a ∈ U has weight w(a), we want to estimate the total weight W = a∈U w(a) to within factor of 1 ± ε with some constant probability > 1/2. Since n = |U | is large, we want to do this without looking at the entire set U . In the traditional setting in which we are allowed to sample elements from U uniformly, sampling Ω(n) items is necessary to provide any non-trivial guarantee on the estimate. Therefore, we investigate this problem in different settings: in the proportional setting we can sample items with probabilities proportional to their weights, and in the hybrid setting we can sample both proportionally and uniformly. These settings have applications, for example, in sublinear-time algorithms and distribution testing.

Sum estimation in the proportional and hybrid setting has been considered before by Motwani, Panigrahy, and Xu [ICALP, 2007]. In their paper, they give both upper and lower bounds in terms of n. Their bounds are near-matching in terms of n, but not in terms of ε. In this paper, we improve both their upper and lower bounds. Our bounds are matching up to constant factors in both settings, in terms of both n and ε. No lower bounds with dependency on ε were known previously. In the proportional setting, we improve their Õ( √ n/ε 7/2 ) algorithm to O( √ n/ε). In the hybrid setting, we improve Õ( 3 √ n/ε 9/2 ) to O( 3 √ n/ε 4/3 ). Our algorithms are also significantly simpler and do not have large constant factors.

We then investigate the previously unexplored scenario in which n is not known to the algorithm. In this case, we obtain a O( √ n/ε + log n/ε 2 ) algorithm for the proportional setting, and a O( √ n/ε) algorithm for the hybrid setting. This means that in the proportional setting, we may remove the need for advice without greatly increasing the complexity of the problem, while there is a major difference in the hybrid setting. We prove that this difference in the hybrid setting is necessary, by showing a matching lower bound.

Our algorithms have applications in the area of sublinear-time graph algorithms. Consider a large graph G = (V, E) and the task of (1 ± ε)-approximating |E|. We consider the (standard) settings where we can sample uniformly from E or from both E and V . This relates to sum estimation as follows: we set U = V and the weights to be equal to the degrees. Uniform sampling then corresponds to sampling vertices uniformly. Proportional sampling can be simulated by taking a random edge and picking one of its endpoints at random. If we can only sample uniformly from E, then our results immediately give a O( |V |/ε) algorithm. When we may sample both from E and V , our results imply an algorithm with complexity O( 3 |V |/ε 4/3 ). Surprisingly, one of our subroutines provides an (1 ± ε)-approximation of |E| using Õ(d/ε 2 ) expected samples, where d is the average degree, under the mild assumption that at least a constant fraction of vertices are non-isolated. This subroutine works in the setting where we can sample uniformly from both V and E. We find this remarkable since it is O(1/ε 2 ) for sparse graphs.