
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers
In this paper, we study the query complexity of parameterized decision a...
read it

Triangle Estimation using Polylogarithmic Queries
Estimating the number of triangles in a graph is one of the most fundame...
read it

Edge Estimation with Independent Set Oracles
We study the problem of estimating the number of edges in a graph with a...
read it

Modularity in QueryBased Concept Learning
We define and study the problem of modular concept learning, that is, le...
read it

Active Learning a Convex Body in Low Dimensions
Consider a set P ⊆R^d of n points, and a convex body C provided via a se...
read it

Joint Alignment From Pairwise Differences with a Noisy Oracle
In this work we consider the problem of recovering n discrete random var...
read it

The εtNet Problem
We study a natural generalization of the classical ϵnet problem (Haussl...
read it
Hyperedge Estimation using Polylogarithmic Subset Queries
A hypergraph H is a set system (U( H), F(H)), where U( H) denotes the set of n vertices and F(H), a set of subsets of U( H), denotes the set of hyperedges. A hypergraph H is said to be duniform if every hyperedge in H consists of exactly d vertices. The cardinality of the hyperedge set is denoted as  F( H) =m( H). We consider an oracle access to the hypergraph H of the following form. Given d (nonempty) pairwise disjoint subsets of vertices A_1,...,A_d ⊆ U( H) of hypergraph H, the oracle, known as the Generalized dpartite independent set oracle () (that was introduced in BishnuGKM018), answers Yes if and only if there exists a hyperedge in H having (exactly) one vertex in each A_i, i ∈ [d]. The oracle belongs to the class of oracles for subset queries. The study of subset queries was initiated by Stockmeyer Stockmeyer85, and later the model was formalized by Ron and Tsur RonT16. Subset queries generalize the set membership queries. In this work we give an algorithm for the problem using the query oracle to obtain an estimate m for m( H) satisfying (1  ϵ) · m( H) ≤m≤ (1 + ϵ) · m( H). The number of queries made by our algorithm, assuming d as a constant, is polylogarithmic in the number of vertices of the hypergraph. Our work can be seen as a natural generalization of Edge Estimation using Bipartite Independent Set( BIS) oracle BeameHRRS18 and Triangle Estimation using Tripartite Independent Set( TIS) oracle Bhattaabs180800691.
READ FULL TEXT
Comments
There are no comments yet.