Bipartite Communities via Spectral Partitioning

Abstract

In this paper we are interested in finding communities with bipartite structure. A bipartite community is a pair of disjoint vertex sets S, \(S'\) such that the number of edges with one endpoint in S and the other endpoint in \(S'\) is “significantly more than expected.” This additional structure is natural to some applications of community detection. In fact, using other terminology, they have already been used to study correlation networks, social networks, and two distinct biological networks.