SearcharxivSearch

arXiv · 1511.02962

Uniform Integrability of the OLS Estimators, and the Convergence of their Moments

Abstract

The problem of convergence of moments of a sequence of random variables to the moments of its asymptotic distribution is important in many applications. These include the determination of the optimal training sample size in the cross validation estimation of the generalization error of computer algorithms, and in the construction of graphical methods for studying dependence patterns between two biomarkers. In this paper we prove the uniform integrability of the ordinary least squares estimators of a linear regression model, under suitable assumptions on the design matrix and the moments of the errors. Further, we prove the convergence of the moments of the estimators to the corresponding moments of their asymptotic distribution, and study the rate of the moment convergence. The canonical central limit theorem corresponds to the simplest linear regression model. We investigate the rate of the moment convergence in canonical central limit theorem proving a sharp improvement of von Bahr's (1965) theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Georgios Afendras, Marianthi Markatou. 2018-06-13. Uniform Integrability of the OLS Estimators, and the Convergence of their Moments. https://doi.org/10.1007/s11749-016-0498-y

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