Introduction to Network Analysis in Python
Analyze, visualize and query networks in Python with NetworkX, using centrality, shortest paths and cliques on Twitter and GitHub data.
Networks such as a Twitter user graph or a group of GitHub collaborators are data made of nodes and the links between them, and this course analyzes them in Python. You load and query graphs with the NetworkX library, draw them as matrix, arc and Circos plots, measure which nodes matter through degree and betweenness centrality, find shortest paths, and look for cliques and communities. The work ends with a recommendation system that suggests GitHub users who should work together.
What You Will Achieve
- Build and query a graph in NetworkX, checking whether it is directed, weighted or has self-loops
- Choose a matrix, arc or Circos plot to visualize a network and draw it
- Rank nodes by degree and betweenness centrality and trace the shortest path between two of them
- Find triangles, maximal cliques and subgraphs, then use them to recommend new collaborators
Program Overview
Network Basics and Visualization with NetworkX
Core network concepts and the NetworkX API, applied to a Twitter network dataset and the main types of graphs.
- Graph queries with NetworkX
- Directed and undirected graphs, edge weights and self-loops
- Matrix, arc and Circos plots
Centrality, Shortest Paths, and Cliques
Ways to find the nodes that matter most in a network, the basics of path-finding, and the triangles and cliques inside network data.
- Degree centrality and degree distribution
- Shortest path algorithms and betweenness centrality
- Applying centrality to the Twitter network
- Triangles, maximal cliques and subgraphs
GitHub Collaborator Network Case Study
One extended case study on GitHub collaborator data that draws on every earlier chapter and ends with a recommendation system.
- Characterizing the network
- Visualizing the collaborator network
- Cliques, key collaborators and editing communities
- Recommending co-editors
Certificate Awarded (Paid)
Job Outlook
Network analysis skills are used in data science work on data that records links between people or things, such as social networks, collaboration data and transportation systems like bike sharing.
Good for: Python users who want to study social or collaboration data as graphs and write NetworkX code in every exercise.
Keep in mind: Most exercises run on a single Twitter network dataset and the closing case study uses GitHub collaborator data, so every worked example comes from social networks.
Bottom line: A NetworkX course that applies centrality, paths and cliques to a Twitter graph, then builds a working collaborator recommender on GitHub data.
Frequently Asked Questions
Which social networks does the course analyze?
A Twitter network dataset runs through most of the course, and two lessons after the centrality work return to it to apply degree and betweenness centrality. The final chapter switches to GitHub collaborator network data for the case study.
What does the final case study build?
You characterize the GitHub collaborator network, plot it, find its cliques, identify key collaborators and editing communities, and finish with a recommendation system that suggests users who have not yet edited together.
What graph types does the course work with?
The opening chapter separates directed from undirected graphs, shows how to set weights on edges, and checks graphs for self-loops, so you can tell what kind of network a dataset holds before analyzing it.


There are no reviews yet.