Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Network Science with Python and NetworkX Quick Start Guide
  • Toc
  • feedback
Network Science with Python and NetworkX Quick Start Guide

Network Science with Python and NetworkX Quick Start Guide

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

Network Science with Python and NetworkX Quick Start Guide

5 (3)
By: 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

Global clustering

The level of clustering or transitivity in a network can be quantified using triangles, just as the transitivity was quantified for individual nodes in Chapter 5, The Small Scale – Nodes and Centrality. These measures describe, overall, how common triangles are within a network.

The simplest measure of large-scale clustering is transitivity: the fraction of possible triangles that are present. The following example uses the transitivity() function to calculate this value for the example networks:

nx.transitivity(G_karate)
0.2556818181818182

nx.transitivity(G_electric)
0.07190412782956059

nx.transitivity(G_internet)
0.135678391959799

An alternative approach is to average the local clustering coefficient (described in Chapter 5, The Small Scale – Nodes and Centrality) over all nodes. This measure is sometimes called the global clustering coefficient. In...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete