General Information

**Class Time and Place: ** MR 12:00 - 1:50 PM, Location TBD

**Instructor: ** Stacy Patterson sep AT cs.rpi.edu

**Office Hours: **TBD

Course Description

Networked systems are systems composed of dynamic units that interact over a network. These systems can be used to perform team objectives with applications ranging from formation flying to distributed computation. This course will cover a variety of modeling and analysis techniques for different types of networked systems. The course will also survey recent research on real-world networked systems applications including power networks, social networks, and sensor networks.

This course will be similar in spirit to the following courses, though adapted for computer scientists. No background in controls or dynamical systems is needed.

- UCSB - Distributed Algorithms and Network Systems
- Technion - Networked Dynamic Systems: Analysis and Design

Prerequisites

Since this course is offered through the Computer Science Department, we will focus on discrete time models and systems (since computer scientists love discrete math). To do well in this course, you should meet the following pre-reqs:

- CSCI-2300: Intro. to algorithms (required for CS undergrads only)
- MATH 2010: Multivariable Calculus and Matrix Algebra
- Familiarity with optimization
- Familiarity with probability theory (e.g., MATP 4600)

Topics (prospective list)

- Models of Distributed Systems
- Graph Theory For Networked Systems
- Consensus Algorithms
- Opinion Dynamics in Social Networks
- Gossip Algorithms and Epidemics
- The Robot Rendezvous Problem
- Distributed Estimation Algorithms