We present a new approach to the problem of *Finding Communities*: a community is a subset of actors who induce a locally optimal subgraph with respect to a density function defined on subsets of actors. Two different subsets with significant overlap can both be locally optimal, and in this way we may obtain overlapping communities. We design, implement, and test two novel efficient algorithms, RaRe and IS, which find communities according to our definition. These algorithms are shown to work effectively on both synthetic and real-world graphs, and also are shown to outperform a well-known k-neighborhood heuristic.
BAUMES, Jeffrey, GOLDBERG, Mark, KRISHNAMOORTHY, Mukkai, MAGDON-ISMAIL, Malik and PRESTON, Nathan, 2005. *Finding Communities* by Clustering a Graph into Overlapping Subgraphs.