Subgraph Detection with Cues Using Belief Propagation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2016

Subgraph Detection with Cues Using Belief Propagation

La Detection de Sousgraphes en presence des indices grace au Belief Propagation


We consider an Erdos-Renyi graph with $n$ nodes and edge probability $q$ that is embedded with a random subgraph of size $K$ with edge probabilities $p$ such that $p>q.$ We address the problem of detecting the subgraph nodes when only the graph edges are observed, along with some extra knowledge of a small fraction of subgraph nodes, called cued vertices or cues. We employ a local and distributed algorithm called belief propagation (BP). Recent works on subgraph detection without cues have shown that global maximum likelihood (ML) detection strictly outperforms BP in terms of asymptotic error rate, namely, there is a threshold condition that the subgraph parameters should satisfy below which BP fails in achieving asymptotically zero error, but ML succeeds. In contrast, we show that when the fraction of cues is strictly bounded away from zero, i.e., when there exists non-trivial side-information, BP achieves zero asymptotic error even below this threshold, thus approaching the performance of ML detection.
Fichier principal
Vignette du fichier
RR-8974v2.pdf (818.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01394889 , version 1 (10-11-2016)
hal-01394889 , version 2 (10-11-2016)
hal-01394889 , version 3 (23-11-2016)
hal-01394889 , version 4 (06-03-2017)



Arun Kadavankandy, Konstantin Avrachenkov, Laura Cottatellucci, Sundaresan Rajesh. Subgraph Detection with Cues Using Belief Propagation. [Research Report] RR-8974, Inria Sophia Antipolis. 2016, pp.18. ⟨hal-01394889v3⟩
539 View
282 Download



Gmail Facebook X LinkedIn More