We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates of our fixed-graphâ€¦ (More)

We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes n. More precisely, we provide a protocol whichâ€¦ (More)

We consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independentâ€¦ (More)

In decentralized optimization, nodes cooperate to minimize an overall objective function that is the sum (or average) of per-node private objective functions. Algorithms interleave local computationsâ€¦ (More)

Given a linear system, we consider the expected energy to move from the origin to a uniformly random point on the unit sphere as a function of the set of actuated variables. We prove that thisâ€¦ (More)

We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage capabilities that doâ€¦ (More)

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether every element of a polytope of nÃ—n matrices A is stable. We show that this canâ€¦ (More)