Resilient Design of Complex Engineered Systems

This paper presents a complex network and graph spectral approach to calculate the resiliency of complex engineered systems. Resiliency is a key driver in how systems are developed to operate in an unexpected operating environment, and how systems change and respond to the environments in which they operate. This paper deduces resiliency properties of complex engineered systems based on graph spectra calculated from their adjacency matrix representations, which describes the physical connections between components in a complex engineered systems. In conjunction with the adjacency matrix, the degree and Laplacian matrices also have eigenvalue and eigenspectrum properties that can be used to calculate the resiliency of the complex engineered system. One such property of the Laplacian matrix is the algebraic connectivity. The algebraic connectivity is defined as the second smallest eigenvalue of the Laplacian matrix and is proven to be directly related to the resiliency of a complex network. Our motivation in the present work is to calculate the algebraic connectivity and other graph spectra properties to predict the resiliency of the system under design.