有向图的谱复杂度及其在结构分解中的应用
Spectral Complexity of Directed Graphs and Application to Structural Decomposition
摘要:
我们引入了一个新的复杂性度量(称为谱复杂性)的有向图。我们首先将有向图分裂为循环部分和非循环部分。我们定义的频谱复杂度的递归矩阵(与图的递归部分)和Wasserstein距离的频谱。我们表明,图的总复杂性,然后可以定义在频谱复杂性,复杂的单个组件和边缘权重。谱复杂性度量的基本属性是它考虑了图中的有向循环。在工程和软件系统中,这种循环会导致子系统的相互依赖性,并通过软件中的正反馈循环、不稳定性和无限执行循环增加意外后果的风险。此外,我们提出了一种结构分解技术,确定这样的周期使用频谱技术。我们表明,这种分解补充了众所周知的谱分解分析的基础上的费德勒矢量。我们提供了几个例子的计算谱和总的复杂性,包括演示的复杂性单调增加的平均度的随机图。我们还提供了一个例子的频谱复杂性计算的架构的一个现实的固定翼飞机系统。
英文摘要:
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent 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 sub-system 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。