A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
An (α, β)-community is a connected subgraph C with each vertex in C connected to at least β vertices of C (self-loops counted) and each vertex outside of C connected to at most α vertices of C (α < β). In this paper, we present a heuristic algorithm that in practice successfully finds a fundamental community structure. We also explore the structure of (α, β)-communities in various social networks. (α, β)communities are well clustered into a small number of disjoint groups, and there are nodoi:10.1080/15427951.2012.678187 fatcat:sdcd5gn7rjg4lfanwdkzd4klmi