The community detection problem, as a special case of inference on graphs, has received much attention lately. However, in the presence of continuous-valued side information, the behavior of a sharp threshold for exact ...

In this paper, we study the effect of side information on the information limits of recovering a hidden community of size K inside a graph consisting of n nodes with K = o(n). Side information for each node in the graph ...