Learning Erdős-Rényi Random Graphs via Edge Detecting Queries

05/09/2019
by   Zihan Li, et al.
0

In this paper, we consider the problem of learning an unknown graph via queries on groups of nodes, with the result indicating whether or not at least one edge is present among those nodes. While learning arbitrary graphs with n nodes and k edges is known to be hard the sense of requiring Ω( { k^2 n, n^2}) tests (even when a small probability of error is allowed), we show that learning an Erdős-Rényi random graph with an average of k̅ edges is much easier; namely, one can attain asymptotically vanishing error probability with only O(k̅ n) tests. We establish such bounds for a variety of algorithms inspired by the group testing problem, with explicit constant factors indicating a near-optimal number of tests, and in some cases asymptotic optimality including constant factors. In addition, we present an alternative design that permits a near-optimal sublinear decoding time of O(k̅^2 k̅ + k̅ n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2022

Group Testing with Correlation under Edge-Faulty Graphs

In applications of group testing in networks, e.g. identifying individua...
research
04/23/2019

Sublinear-Time Non-Adaptive Group Testing with O(k n) Tests via Bit-Mixing Coding

The group testing problem consists of determining a small set of defecti...
research
04/07/2020

Improved Bounds and Algorithms for Sparsity-Constrained Group Testing

In group testing, the goal is to identify a subset of defective items wi...
research
07/08/2021

Using edge contractions to reduce the semitotal domination number

In this paper, we consider the problem of reducing the semitotal dominat...
research
03/28/2018

On Learning Graphs with Edge-Detecting Queries

We consider the problem of learning a general graph G=(V,E) using edge-d...
research
02/15/2019

Group testing: an information theory perspective

The group testing problem concerns discovering a small number of defecti...
research
06/14/2019

Disentangling Mixtures of Epidemics on Graphs

We consider the problem of learning the weighted edges of a mixture of t...

Please sign up or login with your details

Forgot password? Click here to reset