We consider the problem of detecting a tight community in a sparse random
network. This is formalized as testing for the existence of a dense random
subgraph in a random graph. Under the null hypothesis, the graph is a
realization of an Erd\"os-R\'enyi graph on $N$ vertices and with co