So far, we have assumed that if there are several communities in a network, then those communities are distinct and non-overlapping. In this chapter, we discuss situations in which communities overlap with each other. We describe a number of algorithms for modeling overlapping communities, such as mixed-membership SBMs, link-based clustering, overlapping SBMs, the community-affiliation graph model, and the latent cluster random-effects model.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.