arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.4503cond-mat.dis-nn
收藏

网络邻接矩阵最大特征值的逼近

Approximating the largest eigenvalue of network adjacency matrices

Juan G. Restrepo, Edward Ott, Brian R. Hunt

摘要:

网络邻接矩阵的最大特征值在若干网络过程中起着重要作用(例如,振荡器的同步、有向网络上的逾渗、网络耦合系统的平衡的线性稳定性等)。本文给出了邻接矩阵最大特征值的逼近,并讨论了这些逼近之间的关系。在模拟网络上的数值实验被用来检验我们的结果。

英文摘要:

The largest eigenvalue of the adjacency matrix of a network plays an important role in several network processes (e.g., synchronization of oscillators, percolation on directed networks, linear stability of equilibria of network coupled systems, etc.). In this paper we develop approximations to the largest eigenvalue of adjacency matrices and discuss the relationships between these approximations. Numerical experiments on simulated networks are used to test our results.

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

↑