SearcharxivSearch

arXiv · 1604.06522

Gamma-weibull kernel estimation of the heavy tailed densities

Abstract

We consider the nonparametric estimation of the univariate heavy tailed probability density function (pdf) with a support on $[0,\infty)$ by independent data. To this end we construct the new kernel estimator as a combination of the asymmetric gamma and weibull kernels, ss. gamma-weibull kernel. The gamma kernel is nonnegative, changes the shape depending on the position on the semi-axis and possess good boundary properties for a wide class of densities. Thus, we use it to estimate the pdf near the zero boundary. The weibull kernel is based on the weibull distribution which can be heavy tailed and hence we use it to estimate the tail of the unknown pdf. The theoretical asymptotic properties of the proposed density estimator like bias and variance are derived. We obtain the optimal bandwidth selection for the estimate as a minimum of the mean integrated squared error (MISE). Optimal rate of convergence of the MISE for the density is found.

Explore related subjects

Keep this discovery

BibTeXRIS

L. Markovich. 2016-04-22. Gamma-weibull kernel estimation of the heavy tailed densities. https://arxiv.org/abs/1604.06522

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