arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1512.02461physics.soc-phcs.SI
收藏

基于谱半径界的网络划分

Network partition via a bound of the spectral radius

R J Mondragon

摘要:

基于高度节点间的连接密度,我们引入了谱半径的两个界。我们使用这些边界将网络分成两个集合,其中一个集合包含高度节点,我们将这个集合称为谱核。由谱核形成的子网络的节点的度给出了整个网络的首特征向量的顶部项的近似。我们还提出了一些数值例子显示的依赖性的频谱-核心的折射率系数,它的评价在几个真正的网络和频谱-核心的属性可以用来减少频谱半径。

英文摘要:

Based on the density of connections between the nodes of high degree, we introduce two bounds of the spectral radius. We use these bounds to split a network into two sets, one of these sets contains the high degree nodes, we refer to this set as the spectral--core. The degree of the nodes of the subnetwork formed by the spectral--core gives an approximation to the top entries of the leading eigenvector of the whole network. We also present some numerical examples showing the dependancy of the spectral--core with the assortativity coefficient, its evaluation in several real networks and how the properties of the spectral--core can be used to reduce the spectral radius.

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

↑