Detecting or estimating a dense community from a network graph offers a rich set of problems involving the interplay of algorithms, complexity, and information limits. This talk will present an overview and recent results on this topic (joint work with Yihong Wu and Jiaming Xu).
