Subgraph Detection with cues using Belief Propagation

@article{Kadavankandy2016SubgraphDW,
  title={Subgraph Detection with cues using Belief Propagation},
  author={Arun Kadavankandy and Konstantin Avrachenkov and Laura Cottatellucci and Rajesh Sundaresan},
  journal={ArXiv},
  year={2016},
  volume={abs/1611.04847}
}
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… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.

Belief propagation for subgraph detection with imperfect side-information

  • 2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
VIEW 4 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES