scholarly journals A central limit theorem for sums of functions of residuals in a high-dimensional regression model with an application to variance homoscedasticity test

Test ◽  
2017 ◽  
Vol 27 (4) ◽  
pp. 896-920 ◽  
Author(s):  
Zhidong Bai ◽  
Guangming Pan ◽  
Yanqing Yin
Biometrika ◽  
2019 ◽  
Vol 106 (3) ◽  
pp. 716-723
Author(s):  
Mengyu Xu ◽  
Danna Zhang ◽  
Wei Biao Wu

Summary We establish an approximation theory for Pearson’s chi-squared statistics in situations where the number of cells is large, by using a high-dimensional central limit theorem for quadratic forms of random vectors. Our high-dimensional central limit theorem is proved under Lyapunov-type conditions that involve a delicate interplay between the dimension, the sample size, and the moment conditions. We propose a modified chi-squared statistic and introduce an adjusted degrees of freedom. A simulation study shows that the modified statistic outperforms Pearson’s chi-squared statistic in terms of both size accuracy and power. Our procedure is applied to the construction of a goodness-of-fit test for Rutherford’s alpha-particle data.


2019 ◽  
Vol 21 (01) ◽  
pp. 1750092 ◽  
Author(s):  
Zakhar Kabluchko ◽  
Joscha Prochno ◽  
Christoph Thäle

In this paper, we prove a multivariate central limit theorem for [Formula: see text]-norms of high-dimensional random vectors that are chosen uniformly at random in an [Formula: see text]-ball. As a consequence, we provide several applications on the intersections of [Formula: see text]-balls in the flavor of Schechtman and Schmuckenschläger and obtain a central limit theorem for the length of a projection of an [Formula: see text]-ball onto a line spanned by a random direction [Formula: see text]. The latter generalizes results obtained for the cube by Paouris, Pivovarov and Zinn and by Kabluchko, Litvak and Zaporozhets. Moreover, we complement our central limit theorems by providing a complete description of the large deviation behavior, which covers fluctuations far beyond the Gaussian scale. In the regime [Formula: see text] this displays in speed and rate function deviations of the [Formula: see text]-norm on an [Formula: see text]-ball obtained by Schechtman and Zinn, but we obtain explicit constants.


2011 ◽  
Vol 48 (02) ◽  
pp. 366-388 ◽  
Author(s):  
Eckhard Schlemm

We consider the first passage percolation problem on the random graph with vertex set N x {0, 1}, edges joining vertices at a Euclidean distance equal to unity, and independent exponential edge weights. We provide a central limit theorem for the first passage times l n between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of l n / n as n → ∞. We use generating function techniques to compute the n-step transition kernels of a closely related Markov chain which can be used to explicitly calculate the asymptotic variance in the central limit theorem.


Sign in / Sign up

Export Citation Format

Share Document