Introduction to Network Models
Network science: graph theory, centrality, spectral clustering, random graph models, Markov chains, epidemics, herding and game theory on networks.
Networks shape how friendships form, how information and epidemics spread, and how traffic flows. This course introduces complex networks, their structure and function, with examples from engineering, applied mathematics and the social sciences, in lecture notes, problem sets and a Python project. It covers graph theory, strong and weak ties, centrality and web search, spectral clustering, random and growing network models, Markov chains, information spread, herding and the wisdom of crowds, epidemics, and game theory on networks.
What You Will Achieve
- Measure the structure of a network with degree, centrality and spectral methods
- Model networks with random graphs, the configuration model and preferential attachment
- Analyze spreading processes such as information diffusion, herding and epidemics on networks
- Apply game theory to network problems such as traffic equilibrium and Braess’s paradox
Program Overview
Network Structure
Describing networks and finding what matters in them.
- Graph theory, connectivity, giant components and small worlds
- Strong and weak ties, triadic closure and homophily
- Centrality, PageRank and web search
- Spectral clustering and community detection
Network Models
Random processes that generate networks.
- Random graph models and the friendship paradox
- The configuration model and small-world graphs
- Growing networks, preferential attachment and power laws
Dynamics on Networks
Spreading, learning and strategic behavior over networks.
- Linear dynamical systems, Markov chains and random walks
- Information spread, herding and the wisdom of crowds
- Epidemics and diffusion models
- Game theory and traffic equilibrium on networks
Course Completion
Job Outlook
Network science is used in data science, transportation and infrastructure planning, epidemiology, social media analysis and research in engineering and the social sciences.
Good for: Learners in engineering, data science or the social sciences who want the mathematics of networks with hands-on Python work.
Keep in mind: The problem sets come without published solutions; the textbook, Networks, Crowds, and Markets by Easley and Kleinberg, is free online.
Bottom line: A well-rounded introduction to network science that links graph theory to spreading, learning and strategic behavior.
Frequently Asked Questions
What is the course project?
Build a network from a real dataset in Python, analyze its structure, pose a research question and answer it with a mathematical model; the default topic is controlling epidemics on networks.
Which datasets appear in the problem sets?
They include Zachary's Karate Club network and a primary school contact dataset, with a Python notebook for the random graph models assignment.
Is the textbook available for free?
Yes. Networks, Crowds, and Markets: Reasoning about a Highly Connected World by David Easley and Jon Kleinberg has a free online version on Kleinberg's homepage.



There are no reviews yet.