Developing Spectral Structural Complexity Metrics

doi:10.1109/JSYST.2019.2912368

Return

Developing Spectral Structural Complexity Metrics

2019-12-01

PRE

Antonio Pugliese *

Roshanak Nilchiani

DOI：10.1109/JSYST.2019.2912368

Original

Original request for help

Save

Abstract

En 中文

There are various approaches to measure the complexity of engineered systems. The structural approach to the measurement of system complexity is only one of the possible routes that are currently under consideration. This approach considers the complexity of the internal structure of the system and the organization of its components, as a snapshot frozen in time.The most common approach to the definition of structural complexity metrics is through the concepts of entropy, algorithmic information content, and logical depth. Another approach looks at the set of the eigenvalues-the spectrum-of a graph representation of the system of interest. The most popular spectral structural complexity metrics are graph energy and natural connectivity. The authors in this article present a set of metrics that are created based on the existing metrics. The metrics assume that the graphs representing the system of interest are weighted with values representing the complexity of components and interfaces. The metrics are then explored through two sets of random graphs, representing the architecture of an engineered system.

Keywords:

Complexity metrics

complexity theory

system architecture

structural complexity

systems engineering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.