Dynamics and Stability of Interconnected Systems: A Graph-Theoretic Neuromorphic Approach
Raad Safah A. AL–Juboory *1, Hayder Kadhim Zghair 2, May A. Abdul-Khaled AL-Yaseen 3
1 Directorate of Education of Babylon, Ministry of Education, Babylon, Iraq
2 Department of Software, Information Technology, University of Babylon, Babylon, Iraq
3 Mathematics Department, University of Babylon, Hilla, Babylon, Iraq
Emails: raadalhulali@gmail.com ; hyderkkk@uobabylon.edu.iq
pure.may.alaa@uobabylon.edu.iq
Abstract
We investigate the stability of huge, linked subsystems in separate nonlinear dynamical systems. These systems' properties depend on both their dynamics and their link structure. We examine two concepts of stability. The initial one is connection stability, where a complete system is robust in the meaning of Lyapunov given the uncertainty and temporal fluctuations in the linking lengths among systems. The next is the widely accepted idea of asymptotic stability of the entire system, which is predicated on the premise that all linkages are set at the nominal values. We propose graph-based characteristics of two types of a stable for the situation of homogenous subsystems by making linkages to spectrum graph theory, in particular the spectrum of the sign adjacency matrix. We also obtain constraints on the highest amplitude of the sign adjacency matrix of independent relevance via this method.
Keywords: Complete system; Adjacency matrix; Stability of dynamical systems; Graph.