Random matrices with independent entries: Beyond non-crossing partitions

نویسندگان

چکیده

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular have attracted much attention. [Formula: see text]th moment of limit equals number non-crossing pair-partitions set text]. There are several extensions this result in literature. In paper, we consider a unifying extension which also yields additional results. Suppose text] is an symmetric where entries independently distributed. We show that under suitable assumptions on entries, spectral distribution exists probability or almost surely. moments can be described through partitions general larger than pair-partitions. This gives rise to interesting enumerative combinatorial problems. Several existing results follow from our These include matrix, adjacency sparse homogeneous Erdős–Rényi graph, heavy tailed some banded matrices, matrices profile. Some new these models their main

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Singularity of Random Matrices with Independent Entries

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/ √ n). The purpose of this note is to provide a short and elementary proof of this fact using a Bernoulli decomposition of arbitrary non degenerate random variables.

متن کامل

Delocalization of Eigenvectors of Random Matrices with Independent Entries

We prove that an n× n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n−1/2), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach...

متن کامل

Correlations between eigenvalues of large random matrices with independent entries.

We derive the connected correlation functions for eigenvalues of large Her-mitian random matrices with independently distributed elements using both a diagrammatic and a renormalization group (RG) inspired approach. With the diagrammatic method we obtain a general form for the one, two and three-point connected Green function for this class of ensembles when matrix elements are identically dist...

متن کامل

Non-crossing Linked Partitions and Multiplication of Free Random Variables

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees. AMS subject classification: 05A10 (Enumerative Combinatorics); 46L54(Free Probability and Free Operator Algebras).

متن کامل

Simply Generated Non-Crossing Partitions

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing partitions with constraints on their block sizes. Our main tool is a bijection between non-crossing partitions and plane trees, which maps such simply generated non-c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random matrices : theory and applications

سال: 2022

ISSN: ['2010-3263', '2010-3271']

DOI: https://doi.org/10.1142/s2010326322500216