Publication Cover
Stochastics
An International Journal of Probability and Stochastic Processes
Volume 96, 2024 - Issue 1
51
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Limit theorems for a class of processes generalizing the U-empirical process

ORCID Icon &
Pages 799-845 | Received 02 May 2023, Accepted 13 Feb 2024, Published online: 12 Mar 2024
 

Abstract

In this paper, we develop theory and tools for studying U-processes, a natural higher-order generalization of the empirical processes. We introduce a class of random discrete U-measures that generalize the empirical U-measure. We establish a Glivenko-Cantelli and a Donsker theorem under conditions on entropy numbers prevalent in the theory of empirical processes. These results are proved under some standard structural conditions on the Vapnik-Chervonenkis classes of functions and some mild conditions on the model. The uniform limit theorems discussed in this paper are key tools for many further developments involving empirical process techniques. Our results are applied to prove the asymptotic normality of Liu's simplicial median. We conclude this paper by extending Anscombe's central limit theorem to encompass randomly stopped U-processes, building upon its application to randomly stopped sums of independent random variables.

2000 Mathematics Subject Classifications:

Acknowledgments

The authors express their gratitude to the Editor-in-Chief Prof. Saul Jacka, an Associate Editor, and three referees for their invaluable feedback and thorough review. Their constructive comments and meticulous reading significantly enhanced the original work, leading to a more refined and focused presentation. The first author is extremely honored to dedicate this work to his mother, who is an exemplary role model for him.

Disclosure statement

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Funding

This research received no external funding.

Data availability statement

Not applicable.

CRediT author statement

Inass Soukarieh: Methodology, Investigation, Writing – Original Draft, Writing – Review & Editing.

Salim Bouzebda: Conceptualization, Methodology, Investigation, Writing – Original Draft, Writing – Review & Editing, Supervision.

Both authors contributed equally to this work.

Notes

1 ⊕ is the orthogonal sum in L2(X,A,P).

2 In other words, (ξ1,,ξn)=d(ξπ(1),,ξπ(n)) for any permutation π of {1,,n}.

3 The bracketing number, denoted by N[ ](u,F,d), where d is any pseudonorm on F, describes then the geometric complexity of such a function class F. It is defined as N[ ](u,F,d)=min{m:f1,,fmandb1,,bmwith max1imd(bi)usuch that  fF,∃i{1,,m} with |ffi|bi}.

4 The interest of Poissonization relies on the nice properties of Poisson processes, namely the independence of their increments and the behaviour of their moments. These properties considerably simplify calculations, to be more precise, if η is a Poisson random variable independent of the i.i.d. sequence Xi,iN, X0=0, and if Ak,kN, are disjoint measurable sets, then the processes i=0η1(XiAk)δXi,k=1,2,, are independent.

5 Let P(M) denote the collection of all probability measures on the measurable space (M,B(M)). The Lévy–Prokhorov metric dLP:P(M)2[0,+) is defined by setting the distance between two probability measures dLP(μ,ν):=inf{ϵ>0 | μ(A)ν(Aϵ)+ϵ and ν(A)μ(Aϵ)+ϵ for all AB(M)}.

6 ⊕ is the orthogonal sum in L2(E,E,P)

7 The detailed theory of Cesàro convergence is discussed in Hardy's classic textbook [Citation71]

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.