Homework for the class of Network Dynamics and Learning, made in conjunction with Simone Carena, Francesco Paolo Carmone, Ludovica Mazzucco.
Homework 1, report
- Connectivity and network flows: Max-Flow/Min-Cut theorem, Matchings, Ford-Fulkerson's Algorithm
- Network Flow Optimization: Shortest path optimization and optimal transport, Social Optimum, tolls, Wardrop Equilibrium
Homework 2, report
- Flow Dynamics: French De-Groot dynamics, global/local consensus, generalized theorem, discrete/continous time dynamics
Homework 3, report
- Epidemics and Pairwise Interacting Network Systems: SIR epidemic model, pandemic with/without vaccination, coloring problem