MS&E 135: Networks

Spr 2025-26

Tu, Th 9:00-10:20am
Shriram 104

INSTRUCTOR
Ashish Goel
ashishg@stanford.edu, 650 814 1478
Office Hours: Mon 5-6 pm in person (HEC 308)

TEACHING ASSISTANTS
Naman Gupta
namang@stanford.edu
Erica Zhou
ericaez@stanford.edu
Megan Ja
meganja@stanford.edu

TA Office Hours: Mon 8-9 pm on Zoom, Wed 5-6 pm in person (Huang B007)

IMPORTANT LINKS
Please see OH Zoom links, Attendance Google Form, Ed sign-up, and Gradescope entry code here.

IMPORTANT NOTES
DESCRIPTION and PRE-REQS
This course provides an introduction to how networks underlie our social, technological, and natural worlds, with an emphasis on developing intuitions for broadly applicable concepts in network analysis. The course will include: an introduction to graph theory and graph concepts; social networks; information networks; the aggregate behavior of markets and crowds; network dynamics; information diffusion; the implications of popular concepts such as “six degrees of separation”, the “friendship paradox”, and the “wisdom of crowds”. No advanced mathematical knowledge is assumed. We will use some basic probability (random variables, expectation, independence), and will briefly review these when they are first introduced.

PHILOSOPHY AND LEARNING GOALS
The class aims to provide an Engineering perspective on networked systems, specially those that are socio-economic in nature (e.g. we will not discuss how the Internet routing protocols work). We will take “A first course” approach and focus on intuition. There will be no coding (except for demo purposes or generated by AI agents).

The learning goals are:
DETAILED PLAN
All chapters below refer to the text by Easley and Kleinberg: Networks, Crowds, and Markets, Cambridge University Press, 2010. The text is available online for free and also available as a reasonably priced hard-cover. This is subject to change as the class is being continually updated. You can also access slides from last year if you want to look ahead (but please note that they may change somewhat this year).

Week Day Topic Reading Assignments
Week 1 Tu Course overview; Introduction to graph theory Ch 1, 2.1-2.3 Visit Canvas
Th Strong and weak ties Ch 3.1-3.3 PS0 and PS1 handed Out
Week 2 Tu Homophily, Affiliation; Friendship paradox Ch 4.1-4.3
Th Structural balance Ch 5.1-5.4 PS0 due the next day at 5pm
Week 3 Tu Game theory Ch 6.1-6.9 PS1 due at 5pm; PS2 handed out
Th Congestion, Auctions Ch 8.1-8.2, 9.1-9.2 Collaborative project details published
Week 4 Tu Matching markets Ch 9.3-9.6, 10.1-10.4
Th Bargaining & power Ch 12.1-12.3, 12.5-12.8 PS2 due the next day at 5pm; PS3 Out
Week 5 Tu The web as a network Ch 13.1-13.5
Th In-class Midterm
Week 6 Tu Link Analysis Ch 14.1-14.3 Collaborative project teams and preliminary statement due
Th Web search Ch 14.4-14.5
Week 7 Tu Sponsored search as a market Ch 15.1-15.5
Th Information cascades Ch 16.1-16.7 PS3 due the next day at 5pm; PS4 Out
Week 8 Tu Network effects, cascading behavior Ch 17.1-17.3, 19.1-19.4
Th Rich-get-richer Ch 18.1-18.6
Week 9 Tu Small worlds Ch 20.1-20.6
Th Epidemics Ch 21.1-21.4, 21.6 PS4 due the next day at 5pm; Collaborative project due; PS5 Out
Week 10 Tu Finish any material that did not get covered; special topics
Th Presentations from selected collaborative projects PS5 due the next day at 5pm
Final Mon June 8, 8:30am-11:30am

Slides will be posted on canvas or emailed by the start of lectures.

REQUIREMENTS