LCHI: multiple, overlapping local communities

Abstract

Local community finding algorithms are helpful for finding communities around a seed node especially when the network is large and a global method is too slow. Most local methods find only a single community or are required to be run several times over different seed nodes to create multiple communities. In this paper, we present a new algorithm, LCHI that finds multiple, overlapping communities around a single node. Examples and analyses are presented support the effectiveness of LCHI.