2011
DOI: 10.1109/tit.2011.2137110
|View full text |Cite
|
Sign up to set email alerts
|

Eigenvalue Results for Large Scale Random Vandermonde Matrices With Unit Complex Entries

Abstract: This paper centers on the limit eigenvalue distribution for random Vandermonde matrices with unit magnitude complex entries. The phases of the entries are chosen independently and identically distributed from the interval [−π, π]. Various types of distribution for the phase are considered and we establish the existence of the empirical eigenvalue distribution in the large matrix limit on a wide range of cases. The rate of growth of the maximum eigenvalue is examined and shown to be no greater than O(log N ) an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
44
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 28 publications
(45 citation statements)
references
References 26 publications
(50 reference statements)
1
44
0
Order By: Relevance
“…Besides, numerical simulations suggest that more precise estimates on both the number of significant eigenvalues of GG * /n and its maximal eigenvalue could probably be obtained. Finally, let us mention that the matrix G studied in this paper is related to Vandermonde matrices and random DFT matrices that appear in other contexts in the literature on wireless communications [7], [8], [9], [10] and compressed sensing [11], [12], respectively.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Besides, numerical simulations suggest that more precise estimates on both the number of significant eigenvalues of GG * /n and its maximal eigenvalue could probably be obtained. Finally, let us mention that the matrix G studied in this paper is related to Vandermonde matrices and random DFT matrices that appear in other contexts in the literature on wireless communications [7], [8], [9], [10] and compressed sensing [11], [12], respectively.…”
Section: Discussionmentioning
confidence: 99%
“…A minute's thought shows that we can reduce to the case where all the z variables are distinct. Observe that if i pairs of y variables are identified, there will be of the order of n 2l−i terms in the sum of (8), and so to get the same bound as in the previous section, we can afford to bound i of the z variables by 1 in the original integral (9). We now introduce a combinatorial way to look at the problem.…”
Section: Maximal Eigenvaluementioning
confidence: 99%
“…In particular, the limit of the moments of V * V was proved and a combinatorial formula for the asymptotic moments was given under the hypothesis of continuous density. In [1] their results were extended to more general densities and it was also proved that these moments arise as the moments of a probability measure µ ν,β supported on [0, ∞). This measure depends of course on the measure ν, the distribution of the phases, and on the constant β.…”
Section: Introductionmentioning
confidence: 96%
“…(see [2] or [1] for more details). A random Vandermonde matrix is produced if the entries of the phase vector θ := (θ 1 , .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation