no code implementations • 8 Sep 2019 • Mudassir Shabbir, Waseem Abbas, A. Yasin Yazicioglu, Xenofon Koutsoukos
The bound is based on a sequence of vectors containing the distances between leaders (nodes with external inputs) and followers (remaining nodes) in the underlying network graph.
