This chapter has described many different techniques for quantifying the large-scale structure of networks. Network size can be quantified using the diameter or mean shortest path. Global clustering can be used to quantify how likely a node's neighbors are to be neighbors with each other. Connectivity measures, such as the minimum or average node/edge connectivity, are calculated by finding minimum cuts, and quantify network resilience. The chapter concluded by showing how inequality measures such as entropy and the Gini index can be used to turn small-scale centrality measures into large-scale measures of network centralization. The next chapter discusses medium-scale network structures and community detection.
- Tech Categories
- Best Sellers
- New Releases
- Books
- Videos
- Audiobooks
Tech Categories Popular Audiobooks
- Articles
- Newsletters
- Free Learning
You're reading from Network Science with Python and NetworkX Quick Start Guide
Edward L. Platt creates technology for communities and communities for technology. He is currently a researcher at the University of Michigan School of Information and the Center for the Study of Complex Systems. He has published research on large-scale collective action, social networks, and online communities. He was formerly a staff researcher at the MIT Center for Civic Media. He contributes to many free/open source software projects, including tools for media analysis, network science, and cooperative organizations. He has also done research on quantum computing and fault tolerance. He has an M.Math in Applied Mathematics from the University of Waterloo, as well as B.S degrees in both Computer Science and Physics from MIT.
Read more about Edward L. Platt
Unlock this book and the full library FREE for 7 days
Author (1)
Edward L. Platt creates technology for communities and communities for technology. He is currently a researcher at the University of Michigan School of Information and the Center for the Study of Complex Systems. He has published research on large-scale collective action, social networks, and online communities. He was formerly a staff researcher at the MIT Center for Civic Media. He contributes to many free/open source software projects, including tools for media analysis, network science, and cooperative organizations. He has also done research on quantum computing and fault tolerance. He has an M.Math in Applied Mathematics from the University of Waterloo, as well as B.S degrees in both Computer Science and Physics from MIT.
Read more about Edward L. Platt