Syllabus for “Network Systems” - Francesco Bullo, UCSB ME/ECE 269, Fall 2021

This syllabus is old and will be updated asap, depending upon student interest, not before the first day of class.

Final Exam: official UCSB scheduled time: Tues Dec 7, 8:00am - 11am

Homework Assignment by Chapter

Homework is due one week after the corresponding chapter is fully covered in class.

Chapter #01: “Motivating Problems and Systems”

  • additional introductory slides: (pdf)

  • Exercise 1.1, 1.2, and 1.3

Chapter #02: “Elements of Matrix Theory”

  • Exercises 2.1, 2.2, 2.5, 2.9, 2.10, 2.12, 2.16

  • Optional: 2.13

Chapter #03: “Elements of Graph Theory”

  • Exercises 3.2, 3.3, 3.6

Chapter #04: “The Adjacency Matrix”

  • Exercises: 4.1, 4.5, 4.9

Chapter #05: “Discrete-time Averaging Algorithms”

  • Exercises 5.2, 5.3, 5.7

Chapter #06: “The Laplacian Matrix”

  • Exercises: 6.1, 6.2, 6.3, 6.8, 6.15

Chapter #07: “Continuous-time Averaging Algorithms”

  • Exercises: 7.2, 7.3, 7.4, 7.5

Chapter #08: “Diffusively-coupled Linear Systems”

  • Exercises: 8.3, 8.7

Chapter #09: “The Incidence Matrix and its Applications”

  • Exercises: 9.1, 9.2, 9.3

Chapter #10: “Compartmental and Positive Systems”

  • Exercises: 10.1, 10.4, 10.8, 10.10