اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLimit theorems for functions of marginal quantiles
172
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Multivariate distributions are explored using the joint distributions of marginal sample quantiles. Limit theory for the mean of a function of order statistics is presented. The results include a multivariate central limit theorem and a strong law of large numbers. A result similar to Bahadurs representation of quantiles is established for the mean of a function of the marginal quantiles. In particular, it is shown that [sqrt{n}Biggl(frac{1}{n}sum_{i=1}^nphibigl(X_{n:i}^{(1)},...,X_{n:i}^{(d)}bigr)-bar{gamma}Biggr)=frac{1}{sqrt{n}}sum_{i=1}^nZ_{n,i}+mathrm{o}_P(1)] as $nrightarrowinfty$, where $bar{gamma}$ is a constant and $Z_{n,i}$ are i.i.d. random variables for each $n$. This leads to the central limit theorem. Weak convergence to a Gaussian process using equicontinuity of functions is indicated. The results are established under very general conditions. These conditions are shown to be satisfied in many commonly occurring situations.
قيم البحث
اقرأ أيضاً
We consider the problem of optimal transportation with general cost between a empirical measure and a general target probability on R d , with d $ge$ 1. We extend results in [19] and prove asymptotic stability of both optimal transport maps and poten
tials for a large class of costs in R d. We derive a central limit theorem (CLT) towards a Gaussian distribution for the empirical transportation cost under minimal assumptions, with a new proof based on the Efron-Stein inequality and on the sequential compactness of the closed unit ball in L 2 (P) for the weak topology. We provide also CLTs for empirical Wassertsein distances in the special case of potential costs | $bullet$ | p , p > 1.
For a joint model-based and design-based inference, we establish functional central limit theorems for the Horvitz-Thompson empirical process and the Hajek empirical process centered by their finite population mean as well as by their super-populatio
n mean in a survey sampling framework. The results apply to single-stage unequal probability sampling designs and essentially only require conditions on higher order correlations. We apply our main results to a Hadamard differentiable statistical functional and illustrate its limit behavior by means of a computer simulation.
We consider noisy non-synchronous discrete observations of a continuous semimartingale with random volatility. Functional stable central limit theorems are established under high-frequency asymptotics in three setups: one-dimensional for the spectral
estimator of integrated volatility, from two-dimensional asynchronous observations for a bivariate spectral covolatility estimator and multivariate for a local method of moments. The results demonstrate that local adaptivity and smoothing noise dilution in the Fourier domain facilitate substantial efficiency gains compared to previous approaches. In particular, the derived asymptotic variances coincide with the benchmarks of semiparametric Cramer-Rao lower bounds and the considered estimators are thus asymptotically efficient in idealized sub-experiments. Feasible central limit theorems allowing for confidence are provided.
In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz-Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko-Cantelli and Donsker theorems, and loca
l theorems such as local asymptotic modulus and related ratio-type limit theorems are proved for both the Horvitz-Thompson empirical process, and its calibrated version. Limit theorems of other variants and their condition
This paper derives central limit and bootstrap theorems for probabilities that sums of centered high-dimensional random vectors hit hyperrectangles and sparsely convex sets. Specifically, we derive Gaussian and bootstrap approximations for probabilit
ies $Pr(n^{-1/2}sum_{i=1}^n X_iin A)$ where $X_1,dots,X_n$ are independent random vectors in $mathbb{R}^p$ and $A$ is a hyperrectangle, or, more generally, a sparsely convex set, and show that the approximation error converges to zero even if $p=p_nto infty$ as $n to infty$ and $p gg n$; in particular, $p$ can be as large as $O(e^{Cn^c})$ for some constants $c,C>0$. The result holds uniformly over all hyperrectangles, or more generally, sparsely convex sets, and does not require any restriction on the correlation structure among coordinates of $X_i$. Sparsely convex sets are sets that can be represented as intersections of many convex sets whose indicator functions depend only on a small subset of their arguments, with hyperrectangles being a special case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
