Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Network Science with Python and NetworkX Quick Start Guide
  • Table Of Contents Toc
Network Science with Python and NetworkX Quick Start Guide

Network Science with Python and NetworkX Quick Start Guide

By : Edward L. Platt
5 (3)
close
close
Network Science with Python and NetworkX Quick Start Guide

Network Science with Python and NetworkX Quick Start Guide

5 (3)
By: Edward L. Platt

Overview of this book

NetworkX is a leading free and open source package used for network science with the Python programming language. NetworkX can track properties of individuals and relationships, find communities, analyze resilience, detect key network locations, and perform a wide range of important tasks. With the recent release of version 2, NetworkX has been updated to be more powerful and easy to use. If you’re a data scientist, engineer, or computational social scientist, this book will guide you in using the Python programming language to gain insights into real-world networks. Starting with the fundamentals, you’ll be introduced to the core concepts of network science, along with examples that use real-world data and Python code. This book will introduce you to theoretical concepts such as scale-free and small-world networks, centrality measures, and agent-based modeling. You’ll also be able to look for scale-free networks in real data and visualize a network using circular, directed, and shell layouts. By the end of this book, you’ll be able to choose appropriate network representations, use NetworkX to build and characterize networks, and uncover insights while working with real-world systems.
Table of Contents (15 chapters)
close
close

Summary

This chapter has shown how to analyze the microscale structure of networks by calculating centrality measures and other node-based measures of network structure. Betweenness centrality identifies bridges and brokers: edges and nodes that connect otherwise poorly connected parts of a network. Eigenvector centrality identifies nodes that are connected to other well-connected nodes. Closeness centrality identifies nodes that are, on average, closest to other nodes. Finally, the triangle count and local clustering coefficient quantify how well-connected a node's friends are. By examining a historical social network of suffragette activists, we saw that ranking highly on one centrality value doesn't necessarily mean a node ranks highly on others. While sometimes correlated, different centrality values measure different things, so meaningful results require choosing...

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Network Science with Python and NetworkX Quick Start Guide
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon