随机几何图的谱统计
Spectral statistics of random geometric graphs
摘要:
本文利用随机矩阵理论研究了空间网络的基本模型--随机几何图的谱。考虑到随机几何图形的集合,我们通过最近邻和下一个最近邻的间距分布和通过光谱刚性Delta_3统计的长程相关性来研究光谱的水平间距中的短程相关性。水平间距的这些相关性给出了关于特征向量的本地化、社区结构水平和网络内随机性水平的信息。我们发现泊松和高斯正交系综统计之间的参数依赖的过渡。即空间随机几何图的谱统计量符合Erdos-Renyi、Barabasi-Albert和Watts-Strogatz等随机图中随机矩阵理论的普遍性。
英文摘要:
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the spectrum via the nearest neighbour and next nearest neighbour spacing distribution and long range correlations via the spectral rigidity Delta_3 statistic. These correlations in the level spacings give information about localisation of eigenvectors, level of community structure and the level of randomness within the networks. We find a parameter dependent transition between Poisson and Gaussian orthogonal ensemble statistics. That is the spectral statistics of spatial random geometric graphs fits the universality of random matrix theory found in other models such as Erdos-Renyi, Barabasi-Albert and Watts-Strogatz random graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。