任意度随机网络的谱
Spectra of random networks with arbitrary degrees
摘要:
我们推导出一种消息传递方法,用于计算局部树状网络的谱,并近似它,使我们能够计算封闭形式的表达式或快速数值近似的随机图的谱密度与任意节点度-所谓的配置模型。我们发现后者的近似工作以及所有,但网络的稀疏。我们还推导出的频谱,这是重要的识别网络中的结构相变的频带边缘的位置上的界限。
英文摘要:
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs with arbitrary node degrees -- the so-called configuration model. We find the latter approximation to work well for all but the sparsest of networks. We also derive bounds on the position of the band edges of the spectrum, which are important for identifying structural phase transitions in networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。