Rooted trees and moments of large sparse random matrices
In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach. Also werefine our previous result on the limit of the spectral norm of adja...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2003-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/3346/pdf |
| _version_ | 1797270660657971200 |
|---|---|
| author | Oleksiy Khorunzhiy |
| author_facet | Oleksiy Khorunzhiy |
| author_sort | Oleksiy Khorunzhiy |
| collection | DOAJ |
| description | In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach. Also werefine our previous result on the limit of the spectral norm of adjacency matrix of large random graphs. |
| first_indexed | 2024-04-25T02:07:48Z |
| format | Article |
| id | doaj.art-ea8400ed043c49a78bcf1ea71d46b5f5 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:07:48Z |
| publishDate | 2003-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-ea8400ed043c49a78bcf1ea71d46b5f52024-03-07T14:29:56ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502003-01-01DMTCS Proceedings vol. AC,...Proceedings10.46298/dmtcs.33463346Rooted trees and moments of large sparse random matricesOleksiy Khorunzhiy0Laboratoire de Mathématiques de VersaillesIn these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach. Also werefine our previous result on the limit of the spectral norm of adjacency matrix of large random graphs.https://dmtcs.episciences.org/3346/pdfrandom matricesspectral normrooted trees[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds][info.info-dm] computer science [cs]/discrete mathematics [cs.dm][math.math-co] mathematics [math]/combinatorics [math.co][info.info-cg] computer science [cs]/computational geometry [cs.cg] |
| spellingShingle | Oleksiy Khorunzhiy Rooted trees and moments of large sparse random matrices Discrete Mathematics & Theoretical Computer Science random matrices spectral norm rooted trees [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-cg] computer science [cs]/computational geometry [cs.cg] |
| title | Rooted trees and moments of large sparse random matrices |
| title_full | Rooted trees and moments of large sparse random matrices |
| title_fullStr | Rooted trees and moments of large sparse random matrices |
| title_full_unstemmed | Rooted trees and moments of large sparse random matrices |
| title_short | Rooted trees and moments of large sparse random matrices |
| title_sort | rooted trees and moments of large sparse random matrices |
| topic | random matrices spectral norm rooted trees [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-cg] computer science [cs]/computational geometry [cs.cg] |
| url | https://dmtcs.episciences.org/3346/pdf |
| work_keys_str_mv | AT oleksiykhorunzhiy rootedtreesandmomentsoflargesparserandommatrices |