1.022
Introduction to Network Models
Provides an introduction to complex networks, their structure, and function, with examples from engineering, applied mathematics and social sciences. Topics include spectral graph theory, notions of centrality, random graph models, contagion phenomena, cascades and diffusion, and opinion dynamics.
Fall 2018
Topics
- Course review and discussion
- Project presentations
Readings
- [J] = Jackson, Matthew O. Social and Economic Networks . Princeton University Press, 2010. ISBN: 9780691148205.
- [S] = Shah, Devavrat. Gossip Algorithms . Now Publishers Inc., 2009. ISBN: 9781601982360.
- [N] Chapter 6.1–6.4, 6.7, and 6.9.
- [N] Chapter 7.1–7.3 and 7.6–7.7.
- [E] Chapter 14.3.
- [N] Chapter 6.13.
- [N] Chapter 11.5.
- [N] Chapter 12.1–12.3, 12.5, and 12.7–12.8.
- [E] Chapter 20.1–20.2.
- [J] Chapter 4.1.4.
- [J] Chapter 4.2.6.
- [N] Chapter 15.1.
- [E] Chapter 18.
- [N] Chapter 14.2.
- [N] Chapter 18.1–18.2.
- LEC #: 15 · TOPICS: Markov chains · READINGS: [N] Chapter 6.14.
- [S] Chapter 5.1–5.2.
- [E] Chapter 16.1–16.2.
- [J] Chapter 8.3 and 9.1.
- [E] Chapter 21.
- [J] Chapter 7.1–7.2
- [E] Chapter 6.1–6.4 and 6.10 (A & B).
- [E] Chapter 6.5, 6.6, and 6.9.
- [E] Chapter 8.1–8.3.
- LEC #: 24 · TOPICS: Course review and discussion · READINGS: No readings assigned.
- LEC #: 25 · TOPICS: Project presentations · READINGS: No readings assigned.
Prerequisites & course information
Prereq: ( 1.010A , 18.03 , and ( 1.00 or 1.000 )) or permission of instructor Acad Year 2027-2028: U (Fall) Acad Year 2028-2029: Not offered 4-0-8 units
Sources
- Course catalogue ↗2026–2027
- MIT OpenCourseWare ↗Fall 2018
- MIT OCW calendar ↗
- MIT OCW readings ↗
- MIT OCW syllabus ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.