4.2 Article

Eigenvalues of Euclidean Random Matrices

Journal

RANDOM STRUCTURES & ALGORITHMS
Volume 33, Issue 4, Pages 515-532

Publisher

WILEY
DOI: 10.1002/rsa.20228

Keywords

random matrix; spectral measure; random geometric graphs; spatial point process; Euclidean distance matrix

Ask authors/readers for more resources

We study the spectral measure of large Euclidean random matrices. Tire entries of these matrices are determined by the relative position of n random points in a compact set Omega(n) of R-d. 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 the limit of this limiting distribution as the density of points goes to infinity has a nice expression. We apply our results to the adjacency matrix of the geometric graph. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 33, 515-532, 2008

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available