Introduction to Network Models

Assignments

Homework

Problem sets will be handed out on an approximately biweekly basis and will be due one week later, at the beginning of the lecture on their respective due dates (see Calendar).

Note: Homework 8 is an OPTIONAL assignment. It can substitute for your lowest grade on homework 1–7, if submitted. 

Homework will be worth 30% of the final course grade.

HOMEWORK #	TOPICS
1	Graphs and concepts / Graph properties and algebraic representations / Triadic closure and link formation (PDF)
2	Centrality measures / The Laplacian matrix and spectral clustering / Centrality measures and spectral clustering / Network creation and visualization (PDF) Related resources: primaryschool.csv Zachary’s Karate Club dataset.txt
3	Erdős–Rényi graphs (PDF)
4	Random graph models (PDF) Related resource: Homework 4 notebook.ipynb
5	Uniform attachment model (PDF)
6	Romeo Juliet / Markov chains (PDF)
7	Herding experiment / Influencers and the wisdom of the crowd (PDF)
8	Characterizing the equilibria / Price competition in the airline market (PDF)