SearcharxivSearch

arXiv · 1902.08806

Grenander functionals and Cauchy's formula

Abstract

Let $\hat f_n$ be the nonparametric maximum likelihood estimator of a decreasing density. Grenander characterized this as the left-continuous slope of the least concave majorant of the empirical distribution function. For a sample from the uniform distribution, the asymptotic distribution of the $L_2$-distance of the Grenander estimator to the uniform density was derived in Groeneboom and Pyke (1983) by using a representation of the Grenander estimator in terms of conditioned Poisson and gamma random variables. This representation was also used in Groeneboom and Lopuhaa (1993) to prove a central limit result of Sparre Andersen on the number of jumps of the Grenander estimator. Here we extend this to the proof of a general result on integrals of the Grenander estimator. We also correct Groeneboom and Pyke (1983), where the limit distribution of the sums of gamma and Poisson variables on which the conditioning was done did not have the right form. Saddle point methods and Cauchy's formula are important tools in our development.

Explore related subjects

Keep this discovery

BibTeXRIS

Piet Groeneboom. 2019-02-23. Grenander functionals and Cauchy's formula. https://arxiv.org/abs/1902.08806

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