Partitioning Networks into Clusters and Residuals with Average Association
Abstract
The paper proposes a method of partitioning the vertices of a network into sets with higher internal connectivity (clusters) and a residual set, which may be empty. The residual set contains vertices of the network which do not fit into any clusters.