Book Image

Network Science with Python and NetworkX Quick Start Guide

By : Edward L. Platt
Book Image

Network Science with Python and NetworkX Quick Start Guide

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)

The shell layout

If you liked the circle layout, you'll love the shell layout—it's just a lot of circles. The shell layout places nodes in concentric circles. Its benefits include the following:

  • Can visualize more nodes than a circular layout in the same space
  • More central nodes can be placed closer to the center to convey centrality information

However, the shell layout still does not capture community structure well, and can obscure some edges.

The following code uses the NetworkX shell_layout() function to visualize the karate club network. It's possible to use the default settings, but this example also uses community detection to place related nodes in similar locations:

degrees = dict(G.degree())
labels = sorted(degrees.keys(), key=lambda x: degrees[x], reverse=True)
nlist = []
i, k = 0, 6
while i < len(labels):
shell_labels = labels[i:i+k]
ordered_labels...