Rooted trees and moments of large sparse random matrices

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...

Full description

Bibliographic Details
Main Author:	Oleksiy Khorunzhiy
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2003-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	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]
Online Access:	https://dmtcs.episciences.org/3346/pdf

Similar Items

Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01)

On Greedy Trie Execution
by: Zbigniew Gołębiewski, et al.
Published: (2012-01-01)

Non Uniform Random Walks
by: Nisheeth Vishnoi
Published: (2003-01-01)

Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01)

A Note on the Approximation of Perpetuities
by: Margarete Knape, et al.
Published: (2007-01-01)

Stokes polyhedra for $X$-shaped polyminos
by: Yu. Baryshnikov, et al.
Published: (2012-01-01)

On the Ehrenfeucht-Mycielski Balance Conjecture
by: John C. Kieffer, et al.
Published: (2007-01-01)

HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
by: Philippe Flajolet, et al.
Published: (2007-01-01)

Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01)

The Many Faces of Alternating-Sign Matrices
by: James Propp
Published: (2001-01-01)

Matching solid shapes in arbitrary dimension via random sampling
by: Daria Schymura
Published: (2012-01-01)

Influence of the tie-break rule on the end-vertex problem
by: Pierre Charbit, et al.
Published: (2014-07-01)

Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract
by: Svante Janson
Published: (2012-01-01)

Domination analysis for scheduling on non preemptive uniformly related machines
by: Idan Eisner, et al.
Published: (2012-01-01)

Osculating Random Walks on Cylinders
by: Saibal Mitra, et al.
Published: (2003-01-01)

Average properties of combinatorial problems and thermodynamics of spin models on graphs
by: Alessandro Vezzani, et al.
Published: (2003-01-01)

Classification of large Pólya-Eggenberger urns with regard to their asymptotics
by: Nicolas Pouyanne
Published: (2005-01-01)

q-gram analysis and urn models
by: Pierre Nicodème
Published: (2003-01-01)

Distributional analysis of Robin Hood linear probing hashing with buckets
by: Alfredo Viola
Published: (2005-01-01)

The volume and time comparison principle and transition probability estimates for random walks
by: András Telcs
Published: (2003-01-01)

The distribution of ascents of size $d$ or more in samples of geometric random variables
by: Charlotte Brennan, et al.
Published: (2005-01-01)

Combinatorial Dominance Guarantees for Heuristic Algorithms
by: Daniel Berend, et al.
Published: (2007-01-01)

Quantum random walks in one dimension via generating functions
by: Andrew Bressler, et al.
Published: (2007-01-01)

Counting occurrences for a finite set of words: an inclusion-exclusion approach
by: Frédérique Bassino, et al.
Published: (2007-01-01)

Expected values of statistics on permutation tableaux
by: Sylvie Corteel, et al.
Published: (2007-01-01)

On expected number of maximal points in polytopes
by: Yu. Baryshnikov
Published: (2007-01-01)

Coherent random permutations with record statistics
by: Alexander Gnedin
Published: (2007-01-01)

The average position of the first maximum in a sample of geometric random variables
by: Margaret Archibald, et al.
Published: (2007-01-01)

A new method for computing asymptotics of diagonal coefficients of multivariate generating functions
by: Alexander Raichev, et al.
Published: (2007-01-01)

Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01)

Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles
by: Gilles Radenne
Published: (2001-01-01)

Mixing times of Markov chains on 3-Orientations of Planar Triangulations
by: Sarah Miracle, et al.
Published: (2012-01-01)

Exact $L^2$-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
by: Patrick Bindjeme, et al.
Published: (2012-01-01)

A New Binomial Recurrence Arising in a Graphical Compression Algorithm
by: Yongwook Choi, et al.
Published: (2012-01-01)

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness
by: Edward Bender, et al.
Published: (2012-01-01)

Two-anticoloring of planar and related graphs
by: Daniel Berend, et al.
Published: (2005-01-01)

Analysis of tree algorithm for collision resolution
by: Laszlo Gyorfi, et al.
Published: (2005-01-01)

Rigorous Result for the CHKNS Random Graph Model
by: Rick Durrett
Published: (2003-01-01)

Discrete Random Walks on One-Sided ``Periodic'' Graphs
by: Michael Drmota
Published: (2003-01-01)

Entropic repulsion on a rarefied wall
by: L. R. G. Fontes, et al.
Published: (2003-01-01)