Decisions and Computations across Networks

Graduate / Professional

Within the field of network science there has long been interest in distributed computation and distributed decision-making problems of many types. Among these are consensus and flocking problems, the multi-robot rendezvous problem, distributed averaging, distributed solutions to linear algebraic equations, social networking problems, localization of sensors in a multisensor network, and the distributed management of robotic formations. The aim of this course is to explain what these problems are and to discuss their solutions. Related concepts from spectral graph theory, rigid graph theory, non-homogeneous Markov chain theory, stability theory, and linear system theory are covered. Prerequisite: although most of the mathematics needed are covered in the lectures, students taking this course should have a working understanding of basic linear algebra. MW 2:35pm-3:50pm