اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExtension of Donskers Invariance Principle with Incomplete Partial-Sum Process
80
0
0.0
(
0
)
تأليف
Jingwei Liu
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Based on deleting-item central limit theory, the classical Donskers theorem of partial-sum process of independent and identically distributed (i.i.d.) random variables is extended to incomplete partial-sum process. The incomplete partial-sum process Donskers invariance principles are constructed and derived for general partial-sum process of i.i.d random variables and empirical process respectively, they are not only the extension of functional central limit theory, but also the extension of deleting-item central limit theory. Our work enriches the random elements structure of weak convergence.
قيم البحث
اقرأ أيضاً
The deleting items theorems of weak law of large numbers (WLLN),strong law of large numbers (SLLN) and central limit theorem (CLT) are derived by substituting partial sum of random variable sequence with deleting items partial sum. We address the bac
kground of deleting items limit theory of random variable sequence, discuss the classical limit theory of Chebyshev WLLN, Bernoulli WLLN and Khinchine WLLN with standard mathematical analytical technique, then develop the deleting items theorems of WLLN, SLLN and CLT based on convergence theorems and Slutskys theorem. Our theorems extend the classical limit theory of random variable sequence and provide the construction of some asymptotic bias estimators of sample expectation and variance.
We study the rate of convergence of the Mallows distance between the empirical distribution of a sample and the underlying population. The surprising feature of our results is that the convergence rate is slower in the discrete case than in the absol
utely continuous setting. We show how the hazard function plays a significant role in these calculations. As an application, we recall that the quantity studied provides an upper bound on the distance between the bootstrap distribution of a sample mean and its true sampling distribution. Moreover, the convenient properties of the Mallows metric yield a straightforward lower bound, and therefore a relatively precise description of the asymptotic performance of the bootstrap in this problem.
We modify ETAS models by replacing the Pareto-like kernel proposed by Ogata with a Mittag-Leffler type kernel. Provided that the kernel decays as a power law with exponent $beta + 1 in (1,2]$, this replacement has the advantage that the Laplace trans
form of the Mittag-Leffler function is known explicitly, leading to simpler calculation of relevant quantities.
The two parameter Poisson-Dirichlet distribution $PD(alpha,theta)$ is the distribution of an infinite dimensional random discrete probability. It is a generalization of Kingmans Poisson-Dirichlet distribution. The two parameter Dirichlet process $Pi_
{alpha,theta, u_0}$ is the law of a pure atomic random measure with masses following the two parameter Poisson-Dirichlet distribution. In this article we focus on the construction and the properties of the infinite dimensional symmetric diffusion processes with respective symmetric measures $PD(alpha,theta)$ and $Pi_{alpha,theta, u_0}$. The methods used come from the theory of Dirichlet forms.
We consider the deviation inequalities for the sums of independent $d$ by $d$ random matrices, as well as rank one random tensors. Our focus is on the non-isotropic case and the bounds that do not depend explicitly on the dimension $d$, but rather on
the effective rank. In a rather elementary and unified way, we show the following results: 1) A deviation bound for the sums of independent positive-semi-definite matrices of any rank. This result generalizes the dimension-free bound of Koltchinskii and Lounici [Bernoulli, 23(1): 110-133, 2017] on the sample covariance matrix in the sub-Gaussian case. 2) Dimension-free bounds for the operator norm of the sums of random tensors of rank one formed either by sub-Gaussian or log-concave random vectors. This extends the result of Guedon and Rudelson [Adv. in Math., 208: 798-823, 2007]. 3) A non-isotropic version of the result of Alesker [Geom. Asp. of Funct. Anal., 77: 1--4, 1995] on the concentration of the norm of sub-exponential random vectors. 4) A dimension-free lower tail bound for sums of positive semi-definite matrices with heavy-tailed entries, sharpening the bound of Oliveira [Prob. Th. and Rel. Fields, 166: 1175-1194, 2016]. Our approach is based on the duality formula between entropy and moment generating functions. In contrast to the known proofs of dimension-free bounds, we avoid Talagrands majorizing measure theorem, as well as generic chaining bounds for empirical processes. Some of our tools were pioneered by O. Catoni and co-authors in the context of robust statistical estimation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
