Oleksiy Khorunzhiy - Rooted trees and moments of large sparse random matrices

dmtcs:3346 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) - https://doi.org/10.46298/dmtcs.3346
Rooted trees and moments of large sparse random matrices

Authors: Oleksiy Khorunzhiy 1

  • 1 Laboratoire de Mathématiques de Versailles

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.

https://doi.org/10.46298/dmtcs.3346
Source: HAL:hal-01183941v1
Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Imported on: May 10, 2017
Keywords: 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]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1017/s0001867800010661
Source : ScholeXplorer IsRelatedTo DOI 10.1239/aap/999187900
  • 10.1017/s0001867800010661
  • 10.1239/aap/999187900
Sparse random matrices: spectral edge and statistics of rooted trees

Share and export

Consultation statistics

This page has been seen 160 times.
This article's PDF has been downloaded 321 times.