Sparse Random Matrices and Statistics of Rooted Trees

Details Sparse Random Matrices and Statistics of Rooted Trees Sparse Random Matrices and Statistics of Rooted Trees

1999-05-04

arxiv.org/abs/math/9905015v1

Corrected and amended version: Adv. Appl. Probab. 33 (2001) 124-140

Mathematics

Probability

LaTeX, 19 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Sparse Random Matrices and Statistics of Rooted Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sparse Random Matrices and Statistics of Rooted Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse Random Matrices and Statistics of Rooted Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257934