SearcharxivSearch

arXiv · math/0410148

Exact convergence rate and leading term in central limit theorem for student's t statistic

Abstract

The leading term in the normal approximation to the distribution of Student's t statistic is derived in a general setting, with the sole assumption being that the sampled distribution is in the domain of attraction of a normal law. The form of the leading term is shown to have its origin in the way in which extreme data influence properties of the Studentized sum. The leading-term approximation is used to give the exact rate of convergence in the central limit theorem up to order n^{-1/2}, where n denotes sample size. It is proved that the exact rate uniformly on the whole real line is identical to the exact rate on sets of just three points. Moreover, the exact rate is identical to that for the non-Studentized sum when the latter is normalized for scale using a truncated form of variance, but when the corresponding truncated centering constant is omitted. Examples of characterizations of convergence rates are also given. It is shown that, in some instances, their validity uniformly on the whole real line is equivalent to their validity on just two symmetric points.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Hall, Qiying Wang. 2004-10-06. Exact convergence rate and leading term in central limit theorem for student's t statistic. https://doi.org/10.1214/009117904000000252

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR