Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting

09/16/2022
by   Sepehr Assadi, et al.
0

The h-index is a metric used to measure the impact of a user in a publication setting, such as a member of a social network with many highly liked posts or a researcher in an academic domain with many highly cited publications. Specifically, the h-index of a user is the largest integer h such that at least h publications of the user have at least h units of positive feedback. We design an algorithm that, given query access to the n publications of a user and each publication's corresponding positive feedback number, outputs a (1±ε)-approximation of the h-index of this user with probability at least 1-δ in time O(n ·ln(1/δ)/ε^2 · h), where h is the actual h-index which is unknown to the algorithm a-priori. We then design a novel lower bound technique that allows us to prove that this bound is in fact asymptotically optimal for this problem in all parameters n,h,ε, and δ. Our work is one of the first in sublinear time algorithms that addresses obtaining asymptotically optimal bounds, especially in terms of the error and confidence parameters. As such, we focus on designing novel techniques for this task. In particular, our lower bound technique seems quite general – to showcase this, we also use our approach to prove an asymptotically optimal lower bound for the problem of estimating the number of triangles in a graph in sublinear time, which now is also optimal in the error and confidence parameters. This result improves upon prior lower bounds of Eden, Levi, Ron, and Seshadhri (FOCS'15) for this problem, as well as multiple follow-ups that extended this lower bound to other subgraph counting problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2018

A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling

In the subgraph counting problem, we are given a input graph G(V, E) and...
research
11/11/2018

Faster sublinear approximations of k-cliques for low arboricity graphs

Given query access to an undirected graph G, we consider the problem of ...
research
11/29/2022

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching

Sublinear time algorithms for approximating maximum matching size have l...
research
11/18/2017

Superlinear Lower Bounds for Distributed Subgraph Detection

In the distributed subgraph-freeness problem, we are given a graph H, an...
research
01/30/2022

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

We present an algorithm for the maximum matching problem in dynamic (ins...
research
08/15/2018

The Sketching Complexity of Graph and Hypergraph Counting

Subgraph counting is a fundamental primitive in graph processing, with a...
research
02/27/2023

Query-optimal estimation of unitary channels in diamond distance

We consider process tomography for unitary quantum channels. Given acces...

Please sign up or login with your details

Forgot password? Click here to reset