pith. sign in

arxiv: 0710.4617 · v1 · submitted 2007-10-25 · 🧮 math.ST · stat.TH

Limit properties of the monotone rearrangement for density and regression function estimation

classification 🧮 math.ST stat.TH
keywords monotonefunctiondensitydependentestimationlimitrearrangementregression
0
0 comments X
read the original abstract

The monotone rearrrangement algorithm was introduced by Hardy, Littlewood and P\'olya as a sorting device for functions. Assuming that $x$ is a monotone function and that an estimate $x_n$ of $x$ is given, consider the monotone rearrangement $\hat{x}_n$ of $x_n$. This new estimator is shown to be uniformly consistent. Under suitable assumptions, pointwise limit distribution results for $\hat{x}_n$ are obtained. The framework is general and allows for weakly dependent and long range dependent stationary data. Applications in monotone density and regression function estimation are detailed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.