On Euclidean random matrices in high dimension
نویسندگان
چکیده
منابع مشابه
On Euclidean random matrices in high dimension
In this note, we study the n×n random Euclidean matrix whose entry (i, j) is equal to f(‖Xi−Xj‖) for some function f and the Xi’s are i.i.d. isotropic vectors inR. In the regime where n and p both grow to infinity and are proportional, we give some sufficient conditions for the empirical distribution of the eigenvalues to converge weakly. We illustrate our result on log-concave random vectors.
متن کاملOn the high-density expansion for Euclidean Random Matrices
T. S. Grigera, 2 V. Martin-Mayor, G. Parisi, P. Urbani, and P. Verrocchio 8 1 Instituto de Investigaciones Fisicoqúımicas Teóricas y Aplicadas (INIFTA) and Departamento de F́ısica, Facultad de Ciencias Exactas, Universidad Nacional de La Plata, c.c. 16, suc. 4, 1900 La Plata, Argentina CCT La Plata, Consejo Nacional de Investigaciones Cient́ıficas y Técnicas, Argentina Departamento de F́ısica Teór...
متن کاملEigenvalues of Euclidean random matrices
We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of n random points in a compact set Ωn of R. Under various assumptions we establish the almost sure convergence of the limiting spectral measure as the number of points goes to infinity. The moments of the limiting distribution are computed, and we prove that t...
متن کاملOn Euclidean distance matrices
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...
متن کاملProducts of Random Matrices: Dimension and Growth in Norm
Suppose that X1, . . . , Xn, . . . , are independent, identically-distributed, rotationally invariant N×N matrices. Let Πn = Xn . . . X1. It is known that n −1 log ‖Πn‖ converges to a non-random limit. We prove that under certain additional assumptions on matrices Xi the speed of convergence to this limit does not decrease when the size of matrices, N, grows.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2013
ISSN: 1083-589X
DOI: 10.1214/ecp.v18-2340