arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.01418cond-mat.dis-nn
收藏

复杂网络的特征值比统计:无序与随机

Eigenvalue ratio statistics of complex networks: Disorder vs. Randomness

Ankit Mishra, Tanu Raghav, Sarika Jalan

摘要:

随机矩阵连续特征值间距比的分布已成为研究多体系统谱性质的重要工具。本文用数值方法研究了小世界网络、Erdens-Rényi随机网络和邻接矩阵对角无序的(离散)随机网络的特征值比分布。在没有任何对角无序的情况下,这些模型网络的特征值比分布描述了高斯正交系综(GOE)统计。在添加对角无序时,存在从GOE到泊松统计的逐渐过渡,这取决于无序的强度。获得泊松统计所需的临界无序度(wc)随着网络结构中的随机性而增加。我们将wc与最大熵随机游走器达到稳态所需的时间联系起来。这些分析将有助于理解的作用,而不是主要的一个不同的网络动态,如瞬态行为的特征值。

英文摘要:

The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios distribution of various model networks, namely, small-world, Erdős-Rényi random, and (dis)assortative random having a diagonal disorder in the corresponding adjacency matrices. Without any diagonal disorder, the eigenvalues ratio distribution of these model networks depict Gaussian orthogonal ensemble (GOE) statistics. Upon adding diagonal disorder, there exists a gradual transition from the GOE to Poisson statistics depending upon the strength of the disorder. The critical disorder (wc) required to procure the Poisson statistics increases with the randomness in the network architecture. We relate wc with the time taken by the maximum entropy random walker to reach the steady-state. These analyses will be helpful to understand the role of eigenvalues other than the principal one for various network dynamics such as transient behaviour.

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

↑