 
Summary: The Center for Control, Dynamical Systems, and Computation
University of California at Santa Barbara
Winter 2008 Seminar Series
Presents
Randomized Consensus Algorithms over Large Scale
Networks
Fabio Fagnani
University of Torino, Italy
Thursday, January 24, 2008 11:00am12:00pm ESB 1001
Abstract:
Suppose we have a directed graph G with set of nodes V = {1,...,N} and a measure xi
for
every node i V . The average consensus problem consists in computing the average
xA
= N 1
i
xi
in an iterative way, exchanging information among nodes exclusively along
the available edges in G. This problem appears in a number of different contexts since
the 80's (decentralized computation, load balancing, clock synchronization) and, recent
