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. The protocol relies …

In this paper, we study the optimal convergence rate for distributed convex optimization
problems in networks. We model the communication restrictions imposed by the network as …

In this work we introduce an algorithm for distributed average consensus which is able to
deal with asynchronous and unreliable communication systems. It is inspired by two …

A classical model for coupled dynamical systems with identical linear components and
structured linear couplings is enhanced to capture measurement and actuation of by an …

This paper presents a distributed method to estimate the algebraic connectivity of fixed
undirected communication graphs. The proposed algorithm uses bisection to estimate the …

Two novel fast consensus algorithms based on local information of first-order discrete multi-
agent systems under a directed network are proposed in this paper. By applying matrix …

We study the problem of distributedly estimating the k largest/smallest eigenvalues and the
associated eigenvectors of a (possibly weighted) graph. In this work, we propose a …

Algorithms which are efficient and robust are essential to meet the increasing computational
demands in the world today. In this thesis, we consider the analysis and design of both …

By changing the network topology or getting more state information, the convergence speed
can increase, but it cannot be adjusted flexibly. In order to overcome this problem, we …

We consider a distributed consensus problem over a network, where at each time instant
every node receives two pieces of information from disjoint neighboring sets: a weighted …