Related papers: Complex sampling designs: uniform limit theorems a…
The Glivenko--Cantelli theorem is a uniform version of the strong law of large numbers. It states that for every IID sequence of random variables, the empirical measure converges to the underlying distribution (in the sense of uniform…
Ordered pivotal sampling is one of the simplest algorithm to perform without-replacement unequal probability sampling. It has found uses in the context of longitudinal surveys and spatial sampling, and enables in particular a good spatial…
Donsker-type functional limit theorems are proved for empirical processes arising from discretely sampled increments of a univariate L\'evy process. In the asymptotic regime the sampling frequencies increase to infinity and the limiting…
For a joint model-based and design-based inference, we establish functional central limit theorems for the Horvitz-Thompson empirical process and the H\'ajek empirical process centered by their finite population mean as well as by their…
We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…
In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution. Our variant allows for tighter…
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
Let $(X_{n,i})_{1\le i\le n,n\in\mathbb{N}}$ be a triangular array of row-wise stationary $\mathbb{R}^d$-valued random variables. We use a "blocks method" to define clusters of extreme values: the rows of $(X_{n,i})$ are divided into $m_n$…
Piecewise-Deterministic Markov Processes (PDMPs) hold significant promise for sampling from complex probability distributions. However, their practical implementation is hindered by the need to compute model-specific bounds. Conversely,…
We prove a central limit theorem for the Horvitz-Thompson estimator based on the Gram-Schmidt Walk (GSW) design, recently developed in Harshaw et al.(2022). In particular, we consider the version of the GSW design which uses randomized…
We prove a Donsker and a Glivenko--Cantelli theorem for sequences of random discrete measures generalizing empirical measures. Those two results hold under standard conditions upon bracketing numbers of the indexing class of functions. As a…
In this work we introduce a general approach, based on the mar-tingale representation of a sampling design and Azuma-Hoeffding's inequality , to derive exponential inequalities for the difference between a Horvitz-Thompson estimator and its…
This article attempts to offer some perspectives on Bayesian inference for finite population quantities when the units in the population are assumed to exhibit complex dependencies. Beginning with an overview of Bayesian hierarchical…
Based on deleting-item central limit theory, the classical Donsker's theorem of partial-sum process of independent and identically distributed (i.i.d.) random variables is extended to incomplete partial-sum process. The incomplete…
When collections of functional data are too large to be exhaustively observed, survey sampling techniques provide an effective way to estimate global quantities such as the population mean function. Assuming functional data are collected…
We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main…
A notion of local $U$-statistic process is introduced and central limit theorems in various norms are obtained for it. This involves the development of several inequalities for $U$-processes that may be useful in other contexts. This local…
We define the local empirical process, based on $n$ i.i.d. random vectors in dimension $d$, in the neighborhood of the boundary of a fixed set. Under natural conditions on the shrinking neighborhood, we show that, for these local empirical…
This work presents a unified framework that combines global approximations with locally built models to handle challenging nonconvex and nonsmooth composite optimization problems, including cases involving extended real-valued functions. We…
Recently, it has been shown how sampling actions from the predictive distribution over the optimal action-sometimes called Thompson sampling-can be applied to solve sequential adaptive control problems, when the optimal policy is known for…