Clusters in multi-leader directed consensus networks

Abstract

In a directed graph a leader is a node that has no in-degree edges. If there are multiple leaders in a directed consensus network, the system will not reach consensus. In such systems the nodes will organize into clusters or groups of node that converge to the same value. These clusters are not dependent on initial conditions or edge weights. In this paper we study clusters in multi-leader directed consensus networks. Specifically, we present an algorithm to classify all clusters in the graph. © 2020 Institute of Control, Robotics, and Systems - ICROS.