The distance between a naive cumulative estimator and its least concave majorant
Hendrik P. Lopuha\"a, Eni Musta

TL;DR
This paper studies the asymptotic behavior of the difference between a step estimator and its least concave majorant, proving convergence to a Brownian motion process and establishing a CLT for their Lp-distance.
Contribution
It extends previous results to a more general setting, providing new asymptotic distributional limits and a CLT for the estimator's deviation.
Findings
Scaled difference converges to a Brownian motion with parabolic drift.
Established a CLT for the Lp-distance between the estimator and its majorant.
Generalized earlier results to broader conditions.
Abstract
We consider the process , where is a cadlag step estimator for the primitive of a nonincreasing function on , and is the least concave majorant of . We extend the results in Kulikov and Lopuha\"a (2006, 2008) to the general setting considered in Durot (2007). Under this setting we prove that a suitably scaled version of converges in distribution to the corresponding process for two-sided Brownian motion with parabolic drift and we establish a central limit theorem for the -distance between and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The distance between a naive cumulative estimator and its least concave majorant
Hendrik P. Lopuhaä
Eni Musta
DIAM, Faculty EEMCS, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands
Abstract
We consider the process , where is a cadlag step estimator for the primitive of a nonincreasing function on , and is the least concave majorant of . We extend the results in Kulikov and Lopuhaä [2006, 2008] to the general setting considered in Durot [2007]. Under this setting we prove that a suitably scaled version of converges in distribution to the corresponding process for two-sided Brownian motion with parabolic drift and we establish a central limit theorem for the -distance between and .
keywords:
Least concave majorant , Grenander-type estimator , Limit distribution , Central limit theorem for -distance , Brownian motion with parabolic drift
MSC:
[2010] 60F05, 62E20
††journal: Statistics and Probability Letters
1 Introduction
Grenander-type estimators are well known methods for estimation of monotone curves. In case of estimating nonincreasing curves, they are constructed by starting with a naive estimator for the primitive of the curve of interest and then take the left-derivative of the least concave majorant (LCM) of the naive estimator. The first example can be found in Grenander [1956] in the context of estimating a nonincreasing density on on the basis of an i.i.d. sample from . The empirical distribution function of the sample is taken as a naive estimator for the cumulative distribution function corresponding to and the Grenander estimator is found by taking the left-derivative of the least concave majorant . Similar estimators have been developed in other statistical models, e.g., regression (see Brunk [1958]), random censoring (see Huang and Wellner [1995]), or the Cox model (see Lopuhaä and Nane [2013]). Durot [2007] considers Grenander-type estimators in a general setup that incorporates several statistical models. A large part of the literature is devoted to investigating properties of Grenander-type estimators for monotone curves, and somewhat less attention is paid to properties of the difference between the corresponding naive estimator for the primitive of the curve and its LCM.
Kiefer and Wolfowitz [1976] show that . Although the first motivation for this type of result has been asymptotic optimality of shape constrained estimators, it has several important statistical applications. The Kiefer-Wolfowitz result was a key argument in Sen et al. [2010] to prove that the out of bootstrap from works. Mammen [1991] suggested to use the result to make an asymptotic comparison between a smoothed Grenander-type estimator and an isotonized kernel estimator in the regression context. See also Wang and Woodroofe [2007] for a similar application of their Kiefer-Wolfowitz comparison theorem. An extension to a more general setting was established in Durot and Lopuhaä [2014], which has direct applications in Durot et al. [2013] to prove that a smoothed bootstrap from a Grenander-type estimator works for -sample tests, and in Groeneboom and Jongbloed [2013] and Lopuhaä and Musta [2017] to extract the pointwise limit behavior of smoothed Grenander-type estimators for a monotone hazard from that of ordinary kernel estimators. To approximate the -error of smoothed Grenander-type estimators by that of ordinary kernel estimators, such as in Csörgö and Horváth [1988] for kernel density estimators, a Kiefer-Wolfowitz type result no longer suffices. In that case, results on the -distance, between and are more appropriate, such as the ones in Durot and Tocquet [2003] and Kulikov and Lopuhaä [2008].
In this paper, we extend the results in Durot and Tocquet [2003] and Kulikov and Lopuhaä [2008] to the general setting of Durot [2007]. Our main result is a central limit theorem for the -distance between and , where is a naive estimator for the primitive of a monotone curve and is the LCM of . As special cases we recover Theorem 5.2 in Durot and Tocquet [2003] and Theorem 2.1 in Kulikov and Lopuhaä [2008]. Our approach requires another preliminary result, which might be of interest in itself, i.e., a limit process for a suitably scaled difference between and . As special cases we recover Theorem 1 in Wang [1994], Theorem 4.1 in Durot and Tocquet [2003], and Theorem 1.1 in Kulikov and Lopuhaä [2006].
2 Main results
We consider the general setting in Durot [2007]. Let be nonincreasing and assume that we have at hand a cadlag step estimator of
[TABLE]
In the sequel we will make use of the following assumptions.
- (A1)
is strictly decreasing and twice continuously differentiable on with . 2. (A2)
Let be either a Brownian motion or a Brownian bridge. There exists , , , and versions of and such that
[TABLE]
for all . Moreover, is increasing and twice differentiable on , with and
Note that this setup includes several statistical models, such as monotone density, monotone regression, and the monotone hazard model under random censoring, see Durot [2007][Section 3].
We consider the distance between and its least concave majorant , where maps a function into the least concave majorant of on the interval . Consider the process
[TABLE]
and define
[TABLE]
where denotes a standard two-sided Brownian motion originating from zero. For each fixed and , define
[TABLE]
where
[TABLE]
Our first result is the following theorem, which extends Theorem 1.1 in Kulikov and Lopuhaä [2006].
Theorem 1**.**
Suppose that assumptions (A1)-(A2) are satisfied. Let and be defined in (3) and (2). Then the process converges in distribution to the process in , the space of cadlag function on .
Note that as a particular case converges weakly to . In this way, we recover Theorem 1 in Wang [1994] and Theorem 4.1 in Durot and Tocquet [2003]. The proof of Theorem 1 follows the line of reasoning in Kulikov and Lopuhaä [2006].
Let us briefly sketch the argument to prove Theorem 1. Note that and , where , for . Since is a continuous mapping, the main idea is to apply the continuous mapping theorem to properly scaled approximations of the processes and on a suitable chosen fixed interval . The first step is to determine the weak limit of , which is given in the following lemma.
Lemma 2**.**
Suppose that assumptions (A1)-(A2) are satisfied. Then for fixed, the process converges in distribution to the process .
Since and is invariant under addition of linear functions, it follows that the process can be approximated by a Brownian motion with a parabolic drift. The idea now is to use continuity of , for a suitably chosen interval , to show that converges to , where
[TABLE]
In order to relate this to the processes and in Theorem 1, note that , where , and by Brownian scaling, the process has the same distribution as the process . This means that we must compare the concave majorants of on the intervals and , as well as the concave majorants of on the interval and . Lemma 1.2 in Kulikov and Lopuhaä [2006] shows that, locally, with high probability, both concave majorants of the process coincide on , for large . A similar result is established for the concave majorants of the process in Lemma 3, which is analogous to Lemma 1.3 in Kulikov and Lopuhaä [2006]. As a preparation for Theorem 4, the lemma also contains a similar result for a Brownian motion version of .
Let be as in assumption (A2) and let be a distributed random variable independent of , if is a Brownian bridge, and , when is a Brownian motion. Define versions of a Brownian motion by , for , and define
[TABLE]
where , with as in assumption (A2). Furthermore, define , , . The superscripts and refer to the empirical and Brownian motion version. For , let and, for , define the event
[TABLE]
Let and .
Lemma 3**.**
Assume that assumptions (A1)-(A2) hold. For , let be the event defined in (7). There exists , independent of , , , such that
[TABLE]
where is from assumption (A2).
The proof of Theorem 1 now follows the same line of reasoning as that of Theorem 1.1 in Kulikov and Lopuhaä [2006], see Section 3 for more details. The next step is to deal with the norm. Our main result is the following.
Theorem 4**.**
Suppose that assumptions (A1)-(A2) are satisfied and let and be defined by (1) and (2), respectively. Let be a measure on the Borel sets of , such that
- (A3)
* where is differentiable with bounded derivative on .*
Then, for all , (with as in assumption (A2)),
[TABLE]
where
[TABLE]
and
[TABLE]
For the special cases that is a probability density or a regression function, we recover Theorem 2.1 in Kulikov and Lopuhaä [2008] and Theorem 5.2 inDurot and Tocquet [2003], respectively. In order to prove Theorem 4 we first need some preliminary results. We aim at approximating the -norm of by that of the Brownian motion version and then finding the asymptotic distribution for the latter one. To this end, we first need to relate the moments of to those of . We start by showing that, for a rescaled version of can be approximated by the same process plus a linear term. This result corresponds to Lemma 4.1 in Kulikov and Lopuhaä [2008].
Lemma 5**.**
Suppose that assumptions (A1)-(A2) are satisfied. Then, for fixed, for and , it holds , where is linear in and . Moreover, for all ,
[TABLE]
uniformly in . If, in addition (with as in assumption (A2)), then
[TABLE]
uniformly in .
Since the map is invariant under addition of linear terms, Lemma 5 allows us to approximate the moments of by those of for some interval , as in Lemma 4.2 in Kulikov and Lopuhaä [2008].
Lemma 6**.**
Suppose that assumptions (A1)-(A2) are satisfied. and let be the process defined in Lemma 5. Define . Then for all , it holds
[TABLE]
uniformly for . If, in addition , with from condition (A2), then also
[TABLE]
uniformly for .
The process has the same distribution as
[TABLE]
which is close to the process in (5) by continuity of Brownian motion. Lemma 4.3 in Kulikov and Lopuhaä [2008] is then used to show that the concave majorants at zero are sufficiently close. Note that, with by Brownian scaling, the process has the same distribution as the process . As a consequence of Lemma 6 the moments of can be related to those of the process . This formulated in the next lemma, which corresponds to Lemma 4.4 in Kulikov and Lopuhaä [2008].
Lemma 7**.**
Suppose that assumptions (A1)-(A2) are satisfied. Then, for all ,
[TABLE]
uniformly in and
[TABLE]
uniformly in . If, in addition , where is from assumption (A2), then the same (in)equalities hold for .
In Lemmas 6 and 7 the moments of and are approximated by the moments of the same process. This suggests that the difference between them is of smaller order than . Indeed, on the events , where , we make use of Lemma 6 and the fact that is invariant under addition of linear functions to obtain that
[TABLE]
where the processes converge to zero sufficiently fast. On the other hand, on we just need the boundedness of the moments of , which follows by Lemma 7 and the fact that the probability of these events is very small (Lemma 3).
Lemma 8**.**
Suppose that assumptions (A1)-(A2) are satisfied. Then, for , with from assumption (A2), it holds
[TABLE]
uniformly in .
From Lemma 7 it follows that , where is the asymptotic mean in Theorem 4. Moreover, Lemma 8 implies that
[TABLE]
As a consequence, in order to prove Theorem 4, it suffices to prove asymptotic normality of its Brownian motion version
[TABLE]
The proof of this is completely similar to that of Theorem 2.1 in Kulikov and Lopuhaä [2008]. First, by using Theorem 1 for a Brownian version of and the mixing property of (this can be obtained in the same way as Lemma 4.6 in Kulikov and Lopuhaä [2008]), we derive the asymptotic variance of in the following lemma.
Lemma 9**.**
Suppose that assumptions (A1)-(A3) are satisfied. Then, for every ,
[TABLE]
The last step is proving the asymptotic normality of . This is done by a big-blocks small-blocks argument, where the contribution of the small blocks to the asymptotic distribution is negligible, while the mixing property of allows us to approximate the sum over the big blocks by a sum of independent random variables which satisfy the assumptions of Lindeberg central limit theorem.
3 Proofs
Proof of Lemma 2.
The proof is completely similar to that of Lemma 1.1 in Kulikov and Lopuhaä [2006], but this time and , according to (A2). Similar to the proof of Lemma 1.1 in Kulikov and Lopuhaä [2006], this means that
[TABLE]
where in probability for compact . From here on the proof is the same as that of Lemma 1.1 in Kulikov and Lopuhaä [2006]. ∎
Proof Lemma 3.
Let be the left derivative of . Define the inverse process
[TABLE]
where denotes the inverse of . As in the proof of Lemma 1.3 in Kulikov and Lopuhaä [2006][see (2.2)], we get
[TABLE]
Then, with , , and , it holds (see (2.3) in Kulikov and Lopuhaä [2006]),
[TABLE]
Moreover, using the switching relation , we rewrite this probability as
[TABLE]
It suffices to show that there exists positive constants , such that
[TABLE]
because then it follows that
[TABLE]
Similarly we can also bound the second probabilities in (9) and (10). Then the statement of the lemma follows immediately.
Now we prove (11). First write
[TABLE]
Using properties of the functional we obtain that the right hand side is equal to the argmax of the process
[TABLE]
for . By Brownian motion scaling, is equal in distribution to , where is a standard two-sided Brownian motion originating from zero and
[TABLE]
By Taylor’s formula and the assumptions on and , one can show that there exist a constant , independent of , and , such that . Then (11) follows from Theorem 4 in Durot [2002], which proves the first statement.
To continue with the second statement, let be the left derivative of and define the inverse process
[TABLE]
where denotes the inverse of . As in (9), we get
[TABLE]
where similar to (10),
[TABLE]
Then using the switching relation , we rewrite the first probability in (13) as
[TABLE]
According to Lemma 6.4 in Durot et al. [2012], there exists positive constants , independent of , , and , such that
[TABLE]
It follows that
[TABLE]
Similarly we can also bound the second probabilities in (12) and (13). Then the statement of the lemma follows immediately. ∎
Proof Theorem 1.
The proof is similar to the proof of Theorem 1.1 inKulikov and Lopuhaä [2006]. We briefly sketch the main steps. Arguing as in the proof of Theorem 1.1 inKulikov and Lopuhaä [2006], it suffices to show that for any compact , the process converges in distribution to the process on , the space of cadlag functions on , where is defined in (5). By definition , for , where is defined in (5). To prove convergence in distribution, we show that for any bounded continuous function ,
[TABLE]
To this end, we choose sufficiently large, such that and take sufficiently large so that . Then, similar to inequality (2.7) in Kulikov and Lopuhaä [2006], the triangular inequality yields
[TABLE]
In the same way as in Kulikov and Lopuhaä [2006], the three terms on the right hand side are shown to go to zero. For the last term on the right hand side of (15), the argument is exactly the same and makes use of their Lemma 1.2. The first term on the right hand side of (15) is bounded similar to their inequality (2.9) and then uses Lemma 3. For the second term on the right hand side of (15), note that from Lemma 2, it follows that
[TABLE]
converges in distribution to . Therefore, because of the continuity of the mapping , we get , for any bounded and continuous. Moreover, we now have , where
[TABLE]
Similar to the argument leading up to (2.11) in Kulikov and Lopuhaä [2006], from the continuity of , its invariance under addition of linear functions, and continuity of , it follows that . This establishes (14) and finishes the proof.
∎
Proof of Lemma 5.
By a Taylor expansion, together with (6), we can write
[TABLE]
where and
[TABLE]
for some . Then, from the assumptions (A1)-(A2), it follows that
[TABLE]
uniformly in . Similarly, we also obtain
[TABLE]
where and
[TABLE]
for some . Let . From assumption (A2) we have and it follows that
[TABLE]
if . Consequently . ∎
Proof of Lemma 6.
Note that we can write . We have
[TABLE]
To bound the second term on the right hand side, first note that
[TABLE]
because the LCM on always lies above the LCM over . Since is concave, we have that
[TABLE]
which means that . Furthermore,
[TABLE]
In contrast to Kulikov and Lopuhaä [2008] it is more convenient to treat both cases separately. For the case , with (17), we find that
[TABLE]
where
[TABLE]
For the first term on the right hand side we get with Hölder’s inequality
[TABLE]
for any such that , according to (16) and Lemma 3. When , then the right hand side is of the order . For the second term, with Hölder’s inequality
[TABLE]
for any such that . Since all moments of are finite, it follows from Lemma 3 that the right hand side is of the order
[TABLE]
Hence, because and , it follows that .
Next, consider the case . Then with (17) and Cauchy-Schwarz, we find
[TABLE]
Again using that all moments of are finite, according to Lemma 3, the right hand side is of the order . It follows that for ,
[TABLE]
Moreover, Lemma 5 implies that , where . From Lemma 5, we have
[TABLE]
Then as in Lemma 4.2 in Kulikov and Lopuhaä [2008], one can show that
[TABLE]
This finishes the proof. ∎
Proof of Lemma 7.
The proof is exactly the same as the one for Lemma 4.4 in Kulikov and Lopuhaä [2008]. Define , where and . Furthermore, here we take
[TABLE]
As in the proof of Lemma 4.4 in Kulikov and Lopuhaä [2008], it follows that , for , the interval from Lemma 6, and , with only depending on . Let be the process in (5). Then
[TABLE]
where is defined in (8). Lemma 4.3 in Kulikov and Lopuhaä [2008], then allows us to approximate the moments of by the moments of . Completely similar to the proof of Lemma 4.4 in Kulikov and Lopuhaä [2008], the result now follows from Lemma 6 and Brownian scaling. ∎
Proof of Lemma 8.
Let and be as in Lemma 6 and define . Then
[TABLE]
We bound the two terms on the right hand side, following the same line of reasoning as in Lemma 4.5 in Kulikov and Lopuhaä [2008]. Using that according to Lemma 3,
[TABLE]
the second term on the right hand side of (19) is of the order , because . On the other hand, the first term on the right hand side of (19) can be bounded by
[TABLE]
where the right hand side is of the order , according to Lemmas 5 and 7.
In the same way, we have and
[TABLE]
which is of the order , according to Lemma 5. ∎
Proof of Lemma 9.
The proof is completely similar to the proof of Lemma 4.7 in Kulikov and Lopuhaä [2008]. For fixed, and , let , where is defined in (6) and and are defined in (4). According to Theorem 1, converges in distribution to , as defined in (2). As in the proof of Lemma 4.7 in Kulikov and Lopuhaä [2008], Lemma 7 yields that, for , , and fixed, the sequence is uniformly integrable, so that the moments of converge to the corresponding moments of .
Furthermore, the process is strong mixing, i.e., for ,
[TABLE]
where only depends on and from (A2), and where the supremum is taken over all sets and . This can be obtained by arguing completely the same as in the proof of Lemma 4.6 in Kulikov and Lopuhaä [2008]. The rest of the proof is the same as that of Lemma 4.7 in Kulikov and Lopuhaä [2008]. ∎
Proof of Theorem 4.
The proof is completely similar to the proof of Theorem 2.1 in Kulikov and Lopuhaä [2008], by using the method of big-blocks small-blocks and the exponential decreasing mixing function from (20). ∎
References
- Brunk [1958]
Brunk, H. D., 1958. On the estimation of parameters restricted by inequalities. Ann. Math. Statist. 29, 437–454.
- Csörgö and Horváth [1988]
Csörgö, M., Horváth, L., 1988. Central limit theorems for -norms of density estimators. Probab. Theory Related Fields 80 (2), 269–291.
- Durot [2002]
Durot, C., 2002. Sharp asymptotics for isotonic regression. Probab. Theory Related Fields 122 (2), 222–240.
- Durot [2007]
Durot, C., 2007. On the -error of monotonicity constrained estimators. Ann. Statist. 35 (3), 1080–1104.
- Durot et al. [2013]
Durot, C., Groeneboom, P., Lopuhaä, H. P., 2013. Testing equality of functions under monotonicity constraints. J. Nonparametr. Stat. 25 (4), 939–970.
- Durot et al. [2012]
Durot, C., Kulikov, V. N., Lopuhaä, H. P., 2012. The limit distribution of the -error of Grenander-type estimators. Ann. Statist. 40 (3), 1578–1608.
- Durot and Lopuhaä [2014]
Durot, C., Lopuhaä, H. P., 2014. A Kiefer-Wolfowitz type of result in a general setting, with an application to smooth monotone estimation. Electron. J. Stat. 8 (2), 2479–2513.
- Durot and Tocquet [2003]
Durot, C., Tocquet, A.-S., 2003. On the distance between the empirical process and its concave majorant in a monotone regression framework. Ann. Inst. H. Poincaré Probab. Statist. 39 (2), 217–240.
- Grenander [1956]
Grenander, U., 1956. On the theory of mortality measurement. II. Skand. Aktuarietidskr. 39, 125–153 (1957).
- Groeneboom and Jongbloed [2013]
Groeneboom, P., Jongbloed, G., 2013. Smooth and non-smooth estimates of a monotone hazard. In: From probability to statistics and back: high-dimensional models and processes. Vol. 9 of Inst. Math. Stat. (IMS) Collect. Inst. Math. Statist., Beachwood, OH, pp. 174–196.
- Huang and Wellner [1995]
Huang, J., Wellner, J. A., 1995. Estimation of a monotone density or monotone hazard under random censoring. Scand. J. Statist. 22 (1), 3–33.
- Kiefer and Wolfowitz [1976]
Kiefer, J., Wolfowitz, J., 1976. Asymptotically minimax estimation of concave and convex distribution functions. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 34 (1), 73–85.
- Kulikov and Lopuhaä [2006]
Kulikov, V. N., Lopuhaä, H. P., 2006. The limit process of the difference between the empirical distribution function and its concave majorant. Statist. Probab. Lett. 76 (16), 1781–1786.
- Kulikov and Lopuhaä [2008]
Kulikov, V. N., Lopuhaä, H. P., 2008. Distribution of global measures of deviation between the empirical distribution function and its concave majorant. J. Theoret. Probab. 21 (2), 356–377.
- Lopuhaä and Musta [2017]
Lopuhaä, H. P., Musta, E., 2017. Smooth estimation of a monotone hazard and a monotone density under random censoring. Statist. Neerlandica 71, 58–82.
- Lopuhaä and Nane [2013]
Lopuhaä, H. P., Nane, G. F., 2013. Shape constrained non-parametric estimators of the baseline distribution in Cox proportional hazards model. Scand. J. Stat. 40 (3), 619–646.
- Mammen [1991]
Mammen, E., 1991. Estimating a smooth monotone regression function. Ann. Statist. 19 (2), 724–740.
- Sen et al. [2010]
Sen, B., Banerjee, M., Woodroofe, M., 2010. Inconsistency of bootstrap: the Grenander estimator. Ann. Statist. 38 (4), 1953–1977.
- Wang and Woodroofe [2007]
Wang, X., Woodroofe, M., 2007. A Kiefer-Wolfowitz comparison theorem for Wicksell’s problem. Ann. Statist. 35 (4), 1559–1575.
- Wang [1994]
Wang, Y., 1994. The limit distribution of the concave majorant of an empirical distribution function. Statist. Probab. Lett. 20 (1), 81–84.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Brunk [1958] Brunk, H. D., 1958. On the estimation of parameters restricted by inequalities. Ann. Math. Statist. 29, 437–454.
- 2Csörgö and Horváth [1988] Csörgö, M., Horváth, L., 1988. Central limit theorems for L p subscript 𝐿 𝑝 L_{p} -norms of density estimators. Probab. Theory Related Fields 80 (2), 269–291.
- 3Durot [2002] Durot, C., 2002. Sharp asymptotics for isotonic regression. Probab. Theory Related Fields 122 (2), 222–240.
- 4Durot [2007] Durot, C., 2007. On the 𝕃 p subscript 𝕃 𝑝 \mathbb{L}_{p} -error of monotonicity constrained estimators. Ann. Statist. 35 (3), 1080–1104.
- 5Durot et al. [2013] Durot, C., Groeneboom, P., Lopuhaä, H. P., 2013. Testing equality of functions under monotonicity constraints. J. Nonparametr. Stat. 25 (4), 939–970.
- 6Durot et al. [2012] Durot, C., Kulikov, V. N., Lopuhaä, H. P., 2012. The limit distribution of the L ∞ subscript 𝐿 L_{\infty} -error of Grenander-type estimators. Ann. Statist. 40 (3), 1578–1608.
- 7Durot and Lopuhaä [2014] Durot, C., Lopuhaä, H. P., 2014. A Kiefer-Wolfowitz type of result in a general setting, with an application to smooth monotone estimation. Electron. J. Stat. 8 (2), 2479–2513.
- 8Durot and Tocquet [2003] Durot, C., Tocquet, A.-S., 2003. On the distance between the empirical process and its concave majorant in a monotone regression framework. Ann. Inst. H. Poincaré Probab. Statist. 39 (2), 217–240.
