limiting spectral measure
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2018 ◽  
Vol 07 (03) ◽  
pp. 1850006
Author(s):  
Paula Burkhardt ◽  
Peter Cohen ◽  
Jonathan DeWitt ◽  
Max Hlavacek ◽  
Steven J. Miller ◽  
...  

We introduce a new family of [Formula: see text] random real symmetric matrix ensembles, the [Formula: see text]-checkerboard matrices, whose limiting spectral measure has two components which can be determined explicitly. All but [Formula: see text] eigenvalues are in the bulk, and their behavior, appropriately normalized, converges to the semi-circle as [Formula: see text]; the remaining [Formula: see text] are tightly constrained near [Formula: see text] and their distribution converges to the [Formula: see text] hollow GOE ensemble (this is the density arising by modifying the GOE ensemble by forcing all entries on the main diagonal to be zero). Similar results hold for complex and quaternionic analogues. We are able to isolate each regime separately through appropriate choices of weight functions for the eigenvalues and then an analysis of the resulting combinatorics.


2015 ◽  
Vol 04 (03) ◽  
pp. 1550013
Author(s):  
C. Fan ◽  
A. Guionnet ◽  
Y. Song ◽  
A. Wang

We consider the convergence of the eigenvalues to the support of the equilibrium measure in the β matrix models at criticality. We show a phase transition phenomenon, namely that, with probability one, all eigenvalues will fall in the support of the limiting spectral measure when β > 1, whereas this fails when β < 1.


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.


2014 ◽  
Vol 03 (04) ◽  
pp. 1450016 ◽  
Author(s):  
Romain Couillet ◽  
Walid Hachem

Consider the random matrix [Formula: see text] where D and [Formula: see text] are deterministic Hermitian nonnegative matrices with respective dimensions N × N and n × n, and where X is a random matrix with independent and identically distributed centered elements with variance 1/n. Assume that the dimensions N and n grow to infinity at the same pace, and that the spectral measures of D and [Formula: see text] converge as N, n → ∞ towards two probability measures. Then it is known that the spectral measure of ΣΣ* converges towards a probability measure μ characterized by its Stieltjes transform. In this paper, it is shown that μ has a density away from zero, this density is analytical wherever it is positive, and it behaves in most cases as [Formula: see text] near an edge a of its support. In addition, a complete characterization of the support of μ is provided. Aside from its mathematical interest, the analysis underlying these results finds important applications in a certain class of statistical estimation problems.


Sign in / Sign up

Export Citation Format

Share Document