Limit properties of the monotone rearrangement for density and regression function estimation
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 xn of x is given, consider the monotone rearrangement xn of xn. This new estimator is shown to be uniformly consistent. Under suitable assumptions, pointwise limit distribution results for xn 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.