Sparse random matrices; Spectral edge and statistics of rooted trees (Q2726720)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1621396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse random matrices; Spectral edge and statistics of rooted trees |
scientific article; zbMATH DE number 1621396 |
Statements
12 February 2002
0 references
sparse random matrices
0 references
spectral norm
0 references
universality conjecture
0 references
enumeration of trees
0 references
spectral edge
0 references
Erdős-Renyi partial sum
0 references
rooted trees
0 references
high moments
0 references
Erdős-Renyi limit theorem
0 references
large random graph
0 references
Sparse random matrices; Spectral edge and statistics of rooted trees (English)
0 references
The author applies a graph theory method to study the high moments of sparse random square matrices that have, on average, \(p\) non-zero elements per row. The asymptotic behaviour of the spectral norm is evaluated and it is shown that \(p\) has a critical value such that a certain limit of the spectral norm involving \(p\) is bounded or not. Relations with the Erdős-Renyi limit theorem and properties of large random graph are discussed.
0 references
0.8178460597991943
0 references
0.8120899200439453
0 references
0.8117666244506836
0 references
0.8079361915588379
0 references
