This chapter describes how network analysts define and measure groups. Components are the building blocks of group definitions and consist of all the nodes connected to each other through any number of steps in network. Nodes that cannot reach each other are in different components. More complex group definitions are then provided, namely, k-plexes and n-cliques which permit variation in the degree of connectivity among group members needed to be a group member. The Newman-Girvan (2004) algorithm is introduced which provides mutually exclusive groups and a measure of how well the group definitions characterize the data. The chapter closes with a discussion of how groups influence behavior.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.