On Jiang's asymptotic distribution of the largest entry of a sample correlation matrix
Abstract
Let \X, Xk,i; i ≥ 1, k ≥ 1 \ be a double array of nondegenerate i.i.d. random variables and let \pn; n ≥ 1 \ be a sequence of positive integers such that n/pn is bounded away from 0 and ∞. This paper is devoted to the solution to an open problem posed in Li, Liu, and Rosalsky (2010) on the asymptotic distribution of the largest entry Ln = 1 ≤ i < j ≤ pn | (n)i,j | of the sample correlation matrix n = ( i,j(n) )1 ≤ i, j ≤ pn where (n)i,j denotes the Pearson correlation coefficient between (X1, i,..., Xn,i)' and (X1, j,..., Xn,j)'. We show under the assumption EX2 < ∞ that the following three statements are equivalent: align* & (1) n ∞ n2 ∫(n n)1/4∞ ( Fn-1(x) - Fn-1(n nx ) ) dF(x) = 0, \\ & (2) ( n n )1/2 Ln P→ 2, \\ & (3) n → ∞ P (n Ln2 - an ≤ t ) = \ - 18 π e-t/2 \, - ∞ < t < ∞ align* where F(x) = P(|X| ≤ x), x ≥ 0 and an = 4 pn - pn, n ≥ 2. To establish this result, we present six interesting new lemmas which may be beneficial to the further study of the sample correlation matrix.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.