Belief Propagation for Subgraph Detection with Imperfect Side-information

Kadavankandy, Arun and Avrachenkov, Konstantin and Cottatellucci, Laura and Sundaresan, Rajesh (2017) Belief Propagation for Subgraph Detection with Imperfect Side-information. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 1603-1607.

PDF Ieee_Int_Sym_Int_The_1603_2017.pdf - Published Version Restricted to Registered users only Download (174kB) | Request a copy

Abstract

We propose a local message passing algorithm based on Belief Propagation (BP) to detect a small hidden Erdos-Renyi (ER) subgraph embedded in a larger sparse ER random graph in the presence of side-information. We consider side-information in the form of revealed subgraph nodes called cues, some of which may be erroneous. Namely, the revealed nodes may not all belong to the subgraph, and it is not known to the algorithm a priori which cues are correct and which are incorrect. We show that asymptotically as the graph size tends to infinity, the expected fraction of misclassified nodes approaches zero for any positive value of a parameter A, which represents the effective Signal-to-Noise Ratio of the detection problem. Previous works on subgraph detection using BP without side-information showed that BP fails to recover the subgraph when lambda < 1/e. Our results thus demonstrate the substantial gains in having even a small amount of side information.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for this article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	18 May 2018 16:00
Last Modified:	26 Oct 2018 14:45
URI:	http://eprints.iisc.ac.in/id/eprint/59900

Actions (login required)

View Item