Universality of Limiting Spectral Distribution Under Projective Criteria

Author(s):  
Florence Merlevède ◽  
Magda Peligrad
2019 ◽  
Vol 08 (02) ◽  
pp. 1950007
Author(s):  
Kartick Adhikari ◽  
Arup Bose

We show that independent elliptic matrices converge to freely independent elliptic elements. Moreover, the elliptic matrices are asymptotically free with deterministic matrices under appropriate conditions. We compute the Brown measure of the product of elliptic elements. It turns out that this Brown measure is same as the limiting spectral distribution.


2014 ◽  
Vol 03 (04) ◽  
pp. 1450015 ◽  
Author(s):  
Leo Goldmakher ◽  
Cap Khoury ◽  
Steven J. Miller ◽  
Kesinee Ninsuwan

McKay proved the limiting spectral measures of the ensembles of d-regular graphs with N vertices converge to Kesten's measure as N → ∞. Given a large d-regular graph we assign random weights, drawn from some distribution [Formula: see text], to its edges. We study the relationship between [Formula: see text] and the associated limiting spectral distribution obtained by averaging over the weighted graphs. We establish the existence of a unique "eigendistribution" (a weight distribution [Formula: see text] such that the associated limiting spectral distribution is a rescaling of [Formula: see text]). Initial investigations suggested that the eigendistribution was the semi-circle distribution, which by Wigner's Law is the limiting spectral measure for real symmetric matrices. We prove this is not the case, though the deviation between the eigendistribution and the semi-circular density is small (the first seven moments agree, and the difference in each higher moment is O(1/d2)). Our analysis uses combinatorial results about closed acyclic walks in large trees, which may be of independent interest.


Sign in / Sign up

Export Citation Format

Share Document