Central limit theorem of random quadratics forms involving random matrices

https://doi.org/10.1016/j.spl.2007.09.047Get rights and content

Abstract

Let si=1/N(vi,1,,vi,N)T and S=(s1,s2,,sK) where random variables {vij,i,j=1,2,,} are i.i.d. with Ev114<. The central limit theorem of the random quadratic forms s1T(SST)is1 is established, which arises from the application in wireless communications.

Introduction

Let random variables {vij,i,j=1,} be independent and identically distributed (i.i.d.) with Ev11=0 and Ev112=1. Define si=1/N(vi,1,,vi,N)T, i=1,,K, S1=(s2,s3,,sK), S=(s1,s2,,sK). Let λ1λ2λN be the eigenvalues of (N/K)S1S1T and FN be the empirical spectral distribution of (N/K)S1S1T, i.e., FN(x)=i=1NI(λix)N.It is well known that if Ev112< and limNK/N=y>0, then FN(x)a.s.Fy(x),where Fy(x) denotes the limiting spectral distribution. There are many literatures about the convergence of FN(x) (see Bai, 1999 and the references given there).

Lately, the theory of large dimensional random matrices has been a popular tool in the research of the asymptotic problem of code division multiple-access (CDMA) communication systems. For example, one may refer to the work of Tse and Hanly (1999) and Tse and Zeitouni (2000). The application in the communication also puts forward challenges to the large dimensional matrix theory. For instance, to analyze the large system performance of the signal-to-inference (SIR) of some kind of receiver, the random quadratic forms involving random matrix, s1t(S1S1T)is1 and s1t(SST)is1, were introduced by Trichard et al. (2002). However, only the convergence in probability for a special random sequence was given in their work. As we know, the central limit theorem is more powerful than the convergence in probability. Even in wireless communications, central limit theorem can also be used to characterize the fluctuation of the performance of SIR around the asymptotic value. The main object of this paper is to prove that s1t(SST)is1 is asymptotic normal under the assumption Ev114<. Here we would like to emphasize that the random vector s1 is not independent of the random matrix SST.

Section snippets

Main results

For convenience, some notations are firstly introduced. Let αi(N)=s1T(S1S1T)is1,βi(N)=s1T(SST)is1,Xi^=yi(1-y)2(1+y)2tidW0(Fy(t)),yN=KN,φi(yN)=yNixidFyN(x),Xi=Xi^+ξ2yixidFy(x),where Fy(t) is the limiting spectral distribution, W0(t) is a Brownian bridge independent of ξ, which is N(0,Ev114-1). Here FyN(x) is obtained from Fy(x) by replacing y with yN and other analogues below such as φi(yN) have similar meanings. Moreover, i1 is required in the definition of Xi. Our main results are as

The proof of theorem

To simplify the notations, the constant c may denote different values at different occasions in what follows. Before proceeding, we first need some lemmas.

Lemma 3.1

Let gN(s1) be a function of the random vector s1 and ξN be a random variable. Suppose that for uC(F),vC(G), limNP(ξNu|s1)=F(u)a.s.,limNP(gN(s1)v)=G(v),where F(u) and G(v) both are the non-random distribution functions, C(F) and C(G) denote the sets of the continuity points of F(u) and G(v), respectively. Then limNP(ξNu,gN(s1)v)=F(

Acknowledgment

The authors would like to thank an anonymous referee for his constructive comments.

References (11)

  • Z.D. Bai

    Methodologies in spectral analysis of large dimensional random matrices, a review

    Statistica Sinica

    (1999)
  • Z.D. Bai et al.

    No eigenvalues outside the support of the limiting spectral distribution of large dimensional random matrices

    Ann. Probab.

    (1998)
  • Z.D. Bai et al.

    CLT for linear spectral statistics of large dimensional sample covariance matrices

    Ann. Probab.

    (2004)
  • P. Billingsley

    Convergence of Probability Measures

    (1968)
  • X.R. Chen

    Introduction of Mathematics and Statistics

    (1999)
There are more references available in the full text version of this article.

Research supported by Grant 10471135 and 10571001 from the National Natural Science Foundation of China.

View full text