Learning a Hidden Subgraph

We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology. In the deterministic nonadaptive setting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars of a given size or all cliques of a given size. We further describe some bounds that apply to general graphs.

[1]  Vladimir Grebinski,et al.  Optimal Reconstruction of Graphs under the Additive Model , 1997, Algorithmica.

[2]  Miklós Ruszinkó,et al.  On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.

[3]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[4]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5]  Béla Bollobás,et al.  Random Graphs , 1985 .

[6]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[7]  Vladimir Grebinski,et al.  Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping , 1998, Discret. Appl. Math..

[8]  Vladimir Grebinski,et al.  Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[9]  Noga Alon,et al.  Learning a hidden matching , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..