任意期望度随机图的谱
Spectra of random graphs with arbitrary expected degrees
摘要:
我们研究具有任意期望度分布的随机图,并推导出它们的邻接矩阵和模度矩阵的谱的表达式。我们给出了一个完整的处方计算的光谱是准确的限制大网络的大小和大的顶点度。我们还研究了网络中的集线器的频谱上的效果,异常高的程度的顶点,并表明,这些产生孤立的本征值以外的主谱带,类似于凝聚态系统中的杂质状态,伴随着本征向量,强烈本地化的枢纽周围。我们也给出了数值结果,证实了我们的解析表达式。
英文摘要:
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit of large network size and large vertex degrees. We also study the effect on the spectra of hubs in the network, vertices of unusually high degree, and show that these produce isolated eigenvalues outside the main spectral band, akin to impurity states in condensed matter systems, with accompanying eigenvectors that are strongly localized around the hubs. We also give numerical results that confirm our analytic expressions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。