Topology design for fast convergence of network consensus algorithms

The quantities of coefficient of ergodicity and algebraic connectivity have been used to estimate the convergence rates of discrete-time and continuous-time network consensus algorithms respectively. Both of these two quantities are defined with respect to network topologies without the symmetry assumption, and they are applicable to the case when network topologies change with time. We present results identifying deterministic network topologies that optimize these quantities. We will also propose heuristics that can accelerate convergence in random networks by redirecting a small portion of the links assuming that the network topology is controllable