Rooted trees and moments of large sparse random matrices - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

Rooted trees and moments of large sparse random matrices

Abstract

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.
Fichier principal
Vignette du fichier
dmAC0114.pdf (99.42 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01183941 , version 1 (12-08-2015)

Identifiers

Cite

Oleksiy Khorunzhiy. Rooted trees and moments of large sparse random matrices. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.145-154, ⟨10.46298/dmtcs.3346⟩. ⟨hal-01183941⟩
54 View
763 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More