Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter Fourteen: Graph Partitioning: IV. Overlapping Communities

Chapter Fourteen: Graph Partitioning: IV. Overlapping Communities

pp. 362-373

Authors

, Temple University, Philadelphia
  • Add bookmark
  • Cite
  • Share

Summary

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.

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$79.00
Hardback
US$79.00

Have an access code?

To redeem an access code, please log in with your personal login.

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.

Also available to purchase from these educational ebook suppliers