title: Rules and limitations of building delay-tolerant topologies for coupled systems.
abstract: This paper investigates the equilibrium behavior of broadly studied synchronization dynamics of coupled systems, among which shared information is delayed. The underlying relationship is established between graph structures and the largest amount of delay the dynamics can withstand without losing stability. In particular, based on Cartesian product of graphs, we present the rules and limitations for synthesizing the graphs of large-scale systems that can remain stable for as large delays as possible. Examples are provided to demonstrate the results.
authors.affiliation: Department of Mechanical and Industrial Engineering, Northeastern University, Boston, Massachusetts 02115, USA.
authors.forename: Wei
authors.initials: W
authors.lastname: Qiao
authors.forename: Rifat
authors.initials: R
authors.lastname: Sipahi
mesh_terms: D008962:Models, Theoretical; D013269:Stochastic Processes; D013997:Time Factors