大规模网络拉普拉斯矩阵谱性质的结构分析
Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
AI总结:
利用代数图论和凸优化方法,研究网络局部结构特征与拉普拉斯矩阵谱性质之间的关系,推导谱矩的表达式并提出半定规划计算谱半径和谱间隙的边界。
摘要:
利用代数图论和凸优化的方法,我们研究了网络的局部结构特征与其拉普拉斯矩阵谱性质之间的关系。特别地,我们根据一组局部结构测量推导了网络拉普拉斯矩阵所谓的谱矩的表达式。此外,我们提出了一系列半定规划,用于从拉普拉斯谱矩的截断序列计算拉普拉斯矩阵的谱半径和谱间隙的边界。我们的分析表明,拉普拉斯谱矩和谱半径受到网络局部结构特征的强烈约束。另一方面,我们说明了局部结构特征通常不足以估计拉普拉斯谱间隙。
英文摘要:
Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the so-called spectral moments of the Laplacian matrix of a network in terms of a collection of local structural measurements. Furthermore, we propose a series of semidefinite programs to compute bounds on the spectral radius and the spectral gap of the Laplacian matrix from a truncated sequence of Laplacian spectral moments. Our analysis shows that the Laplacian spectral moments and spectral radius are strongly constrained by local structural features of the network. On the other hand, we illustrate how local structural features are usually not enough to estimate the Laplacian spectral gap.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。