arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9905015math.PRmath.COmath.SP
收藏

稀疏随机矩阵与有根树的统计

Sparse Random Matrices and Statistics of Rooted Trees

A. Khorunzhy

摘要:

我们考虑平均每行具有p个非零元素的N维随机对称矩阵A的系综。本文研究了A的范数在N和p无限递增的极限下的渐近性态,证明了p= logN是范数有界或无界的临界值.参数是基于树型图的演算。稀疏随机矩阵的渐近性质基本上取决于树的顶点,我们证明是有限的典型程度。

英文摘要:

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the value p= log N is the critical one for the norm to be either bounded or not. The arguments are based on the calculus of the tree-type graphs. Asymptotic properties of sparse random matrices essentially depend on the typical degree of a tree vertex that we show to be finite.

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

↑