arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.09852cond-mat.stat-mechcond-mat.dis-nnmath-phmath.MP
收藏

加权稀疏图的顶特征对统计量

Top Eigenpair Statistics for Weighted Sparse Graphs

Vito Antonio Rocco Susca, Pierpaolo Vivo, Reimer Kuehn

摘要:

我们发展了一种计算具有有限平均连通度和有界最大度的加权稀疏图的顶特征对的统计量的方法。框架的问题,在优化的二次型的球体上,并引入一个虚构的温度,我们采用腔和副本的方法来找到解决方案的辅助概率密度函数,这可以解决人口动力学的自洽方程。这种推导允许我们识别和解包来自度为$k$的节点的对顶部特征向量的分量的个体贡献。分析结果与大(加权)邻接矩阵的数值对角化完全一致,并进一步交叉检查的情况下,随机正则图和稀疏马尔可夫转移矩阵的无偏随机游动。

英文摘要:

We develop a formalism to compute the statistics of the top eigenpair of weighted sparse graphs with finite mean connectivity and bounded maximal degree. Framing the problem in terms of optimisation of a quadratic form on the sphere and introducing a fictitious temperature, we employ the cavity and replica methods to find the solution in terms of self-consistent equations for auxiliary probability density functions, which can be solved by population dynamics. This derivation allows us to identify and unpack the individual contributions to the top eigenvector's components coming from nodes of degree $k$. The analytical results are in perfect agreement with numerical diagonalisation of large (weighted) adjacency matrices, and are further cross-checked on the cases of random regular graphs and sparse Markov transition matrices for unbiased random walks.

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

↑