arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.04727eess.SYcs.SYmath.OCmath.PRmath.SP
收藏

随机网络的可控性Gramian谱

Controllability Gramian Spectra of Random Networks

Victor M. Preciado, M. Amin Rahimian

AI总结:

本文提出理论框架研究随机状态矩阵系统可控性Gramian的谱特性,利用随机矩阵理论推导其特征值分布矩,并通过常见随机图和矩阵集合验证方法。

摘要:

我们提出一个理论框架,用于研究具有随机状态矩阵系统的可控性Gramian的特征值谱,例如具有随机图结构的网络系统。利用随机矩阵理论,我们提供可控性Gramian特征值分布的矩的表达式。这些矩可以用来推导Gramian特征值分布的有用性质(在某些情况下甚至能得出分布的闭式表达)。我们通过考虑源自常见随机图和矩阵集合的系统矩阵,如Wigner集、高斯正交集合(GOE)和随机正则图,来说明该框架。随后,我们说明如何利用Gramian的特征值分布来推断随机系统控制所需的能量。

英文摘要:

We propose a theoretical framework to study the eigenvalue spectra of the controllability Gramian of systems with random state matrices, such as networked systems with a random graph structure. Using random matrix theory, we provide expressions for the moments of the eigenvalue distribution of the controllability Gramian. These moments can then be used to derive useful properties of the eigenvalue distribution of the Gramian (in some cases, even closed-form expressions for the distribution). We illustrate this framework by considering system matrices derived from common random graph and matrix ensembles, such as the Wigner ensemble, the Gaussian Orthogonal Ensemble (GOE), and random regular graphs. Subsequently, we illustrate how the eigenvalue distribution of the Gramian can be used to draw conclusions about the energy required to control random system.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑