01765nas a2200181 4500008004100000020002200041022002200063245005600085210005500141260005100196300001000247520120400257100001501461700001701476700002101493700002901514856004001543 2015 eng d a978-3-319-23834-0 a978-3-319-23835-700aCommunity Discovery: Simple and Scalable Approaches0 aCommunity Discovery Simple and Scalable Approaches aSwitzerlandbSpringer International Publishing a23-543 aThe increasing size and complexity of online social networks have brought distinct challenges to the task of community discovery. A community discovery algorithm needs to be efficient, not taking a prohibitive amount of time to finish. The algorithm should also be scalable, capable of handling large networks containing billions of edges or even more. Furthermore, a community discovery algorithm should be effective in that it produces community assignments of high quality. In this chapter, we present a selection of algorithms that follow simple design principles, and have proven highly effective and efficient according to extensive empirical evaluations. We start by discussing a generic approach of community discovery by combining multilevel graph contraction with core clustering algorithms. Next we describe the usage of network sampling in community discovery, where the goal is to reduce the number of nodes and/or edges while retaining the network’s underlying community structure. Finally, we review research efforts that leverage various parallel and distributed computing paradigms in community discovery, which can facilitate finding communities in tera- and peta-scale networks.1 aRuan, Yiye1 aFuhry, David1 aLiang, Jiongqian1 aParthasarthy, Srinivasan uhttp://knoesis.wright.edu/node/2152