arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.13872physics.soc-ph
收藏

具有邻接矩阵主特征向量和非主特征向量的网络上动力系统的降维

Dimension reduction of dynamical systems on networks with leading and non-leading eigenvectors of adjacency matrices

Naoki Masuda, Prosenjit Kundu

摘要:

网络动力系统的降维技术被认为是促进我们对原始高维动力学的理解。降维的一种策略是推导出一个低维动力系统,其行为逼近原始动力系统的可观测量,这些可观测量是不同节点处状态变量的加权线性总和。最近提出的方法使用网络的邻接矩阵的前导特征向量作为混合权重来获得这样的可观测量。在本研究中,我们探讨了这种类型的一维约简动力系统的网络时,我们使用的邻接矩阵的非领导特征向量作为混合权重的性能。我们的理论预测,非领导的特征向量可以更有效地比领导的特征向量,使我们能够选择的特征向量最小化的错误。我们数值验证了最佳非主导特征向量优于主导特征向量的一些动力系统和网络。我们还认为,尽管我们的理论,它实际上是更好地使用领先的特征向量作为混合权重,以避免错位的分歧点太远,并抵抗动态噪声。

英文摘要:

Dimension reduction techniques for dynamical systems on networks are considered to promote our understanding of the original high-dimensional dynamics. One strategy of dimension reduction is to derive a low-dimensional dynamical system whose behavior approximates the observables of the original dynamical system that are weighted linear summations of the state variables at the different nodes. Recently proposed methods use the leading eigenvector of the adjacency matrix of the network as the mixture weights to obtain such observables. In the present study, we explore performances of this type of one-dimensional reductions of dynamical systems on networks when we use non-leading eigenvectors of the adjacency matrix as the mixture weights. Our theory predicts that non-leading eigenvectors can be more efficient than the leading eigenvector and enables us to select the eigenvector minimizing the error. We numerically verify that the optimal non-leading eigenvector outperforms the leading eigenvector for some dynamical systems and networks. We also argue that, despite our theory, it is practically better to use the leading eigenvector as the mixture weights to avoid misplacing the bifurcation point too distantly and to be resistant against dynamical noise.

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

↑