Accelerated Diffusion Algorithms on General Dynamic Networks

In this paper, an adaptation of the first order diffusive scheme to dynamic networks and its accelerated version with an optimal relaxation parameter are given. A network with dynamic links assumes that edges of the network topology may be unpredictably broken down. Contrary to the static network framework, the connection graphs of the dynamic network may be always not connected. Various simulations on static and dynamic networks confirm our theoretical results.