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 Twelve: Graph Partitioning: II. Community Detection

Chapter Twelve: Graph Partitioning: II. Community Detection

pp. 294-345

Authors

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

Summary

Much of what is studied in network analysis derives from the observation that nodes in a graph G often tend to form “cohesive groups” or, as they are called in social networks, communities, clusters, or modules. This chapter describes statistical methods for identifying such communities using the stochastic blockmodel and an approach based upon the concept of modularity.

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