Bayesian Vertex Nomination

Understand

Consider an attributed graph whose vertices are colored green or red, but only a few are observed to be red.

• The color of the other vertices is unobserved.
• Typically, the unknown total number of red vertices is small.
• The vertex nomination problem is to nominate one of the unobserved vertices as being red.