Distributed two-time-scale methods over clustered networks
Thiem V. Pham, Thinh T. Doan, and Dinh Hoa Nguyen

TL;DR
This paper introduces a novel distributed two-time-scale consensus algorithm for clustered networks with dense intra-cluster and sparse inter-cluster communication, ensuring convergence despite delays and characterizing the impact of network topology.
Contribution
The paper proposes a new two-time-scale consensus method tailored for clustered networks, with proven convergence under delays and explicit convergence rate formulas.
Findings
Convergence is guaranteed despite large communication delays.
The convergence rate depends explicitly on network topology and delays.
After initial transients, convergence depends only on leader connectivity.
Abstract
In this paper, we consider consensus problems over a network of nodes, where the network is divided into a number of clusters. We are interested in the case where the communication topology within each cluster is dense as compared to the sparse communication across the clusters. Moreover, each cluster has one leader which can communicate with other leaders in different clusters. The goal of the nodes is to agree at some common value under the presence of communication delays across the clusters. Our main contribution is to propose a novel distributed two-time-scale consensus algorithm, which pertains to the separation in network topology of clustered networks. In particular, one scale is to model the dynamic of the agents in each cluster, which is much faster (due to the dense communication) than the scale describing the slowly aggregated evolution between the clusters (due to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
