Spectral Complexity of Directed Graphs and Application to Structural Decomposition release_hn32fl37dnd2dlzklqofolm35a

by Igor Mezic, Vladimir A. Fonoberov, Maria Fonoberova, Tuhin Sahai

Published in Complexity by Hindawi Limited.

2019   Volume 2019, p1-18

Abstract

We introduce a new measure of complexity (called<jats:italic> spectral complexity</jats:italic>) for directed graphs. We start with splitting of the directed graph into its recurrent and nonrecurrent parts. We define the spectral complexity metric in terms of the spectrum of the recurrence matrix (associated with the reccurent part of the graph) and the Wasserstein distance. We show that the total complexity of the graph can then be defined in terms of the spectral complexity, complexities of individual components, and edge weights. The essential property of the spectral complexity metric is that it accounts for directed cycles in the graph. In engineered and software systems, such cycles give rise to subsystem interdependencies and increase risk for unintended consequences through positive feedback loops, instabilities, and infinite execution loops in software. In addition, we present a structural decomposition technique that identifies such cycles using a spectral technique. We show that this decomposition complements the well-known spectral decomposition analysis based on the Fiedler vector. We provide several examples of computation of spectral and total complexities, including the demonstration that the complexity increases monotonically with the average degree of a random graph. We also provide an example of spectral complexity computation for the architecture of a realistic fixed wing aircraft system.
In application/xml+jats format

Archived Files and Locations

application/pdf  4.3 MB
file_px4qxuqklnakff5oip5papsdti
web.archive.org (webarchive)
downloads.hindawi.com (publisher)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2019-01-01
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In Keepers Registry
ISSN-L:  1076-2787
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 15e99209-867e-4940-b6af-baa7cbd4df55
API URL: JSON