We derive the sharp non-asymptotical uniform estimations for tails of distributions for classical normed sums of centered normed independent random vectors having a moderate decreasing individual tails of summands.
We prove large and moderate deviation principles for the distribution of an empirical mean conditioned by the value of the sum of discrete i.i.d. random variables. Some applications for combinatoric problems are discussed.
We apply Lindeberg's method, invented to prove a central limit theorem, to analyze the moderate deviations around such a central limit theorem. In particular, we will show moderate deviation principles for martingales as well as for random sums, in the latter situation both, in the case when the limit distribution is Gaussian or non-Gaussian. Moreover in the Gaussian case we show moderate deviations for random sums using bounds on cumulants, alternatively. Finally, we also prove a large deviation principle for certain random sums.
Several classical results on boundary crossing probabilities of Brownian motion and random walks are extended to asymptotically Gaussian random fields, which include sums of i.i.d. random variables with multidimensional indices, multivariate empirical processes, and scan statistics in change-point and signal detection as special cases. Some key ingredients in these extensions are moderate deviation approximations to marginal tail probabilities and weak convergence of the conditional distributions of certain ``clumps'' around high-level crossings. We also discuss how these results are related t…
We derive in this short report the exponential as well as power decreasing tail estimations for the sums of centered exchangeable random variables, alike ones for the sums of the centered independent ones.
We consider moderately trimmed sums of non-negative i.i.d. random variables. We show that for every distribution function there exists a proper moderate trimming such that for the trimmed sum a non-trivial strong law of large numbers holds. In case that the distribution function has regularly varying tails we give necessary and sufficient conditions on the trimming for a strong law of large numbers to hold.
An example of a discrete-time stationary random process whose sums follow the normal approximation within a given part of the region of moderate deviations, but violate it outside this part.
This is basically a polished presentation for Sections 1,2 of arXiv:0801.1050. The Moderate Deviations Principle (MDP) is well-understood for sums of independent random variables, worse understood for stationary random sequences, and scantily understood for random fields. Here it is established for a new class of random processes. The approach is promising also for random fields.
Correcting for skewness can result in more accurate tail probability approximations in the central limit theorem for sums of independent random variables. In this paper, we extend the theory to sums of local statistics of independent random variables and apply the result to $k$-runs, U-statistics, and subgraph counts in the Erdös-Rényi random graph. To prove our main result, we develop exponential concentration inequalities and higher-order Cramér-type moderate deviations via Stein's method.
The Moderate Deviations Principle (MDP) is well-understood for sums of independent random variables, worse understood for stationary random sequences, and scantily understood for random fields. Here it is established for splittable random fields. Version 2. Adapted to new Version 3 of [2] arXiv:1706.00991. Terminology: "CMS random fields". Numbers of items in [2] updated. References: "response", not "responce". Otherwise unchanged.
The Moderate Deviations Principle (MDP) is well-understood for sums of independent random variables, worse understood for stationary random sequences, and scantily understood for random fields. Here it is established for splittable random fields integrated against test functions. Version 2: minor changes. Interval [0,1] replaced with [0,1) for better compatibility with Part V. Copyedit pages 3, 4, 6, 16, 22, 23.
Let {(X_i,Y_i)}_{i=1}^n be a sequence of independent bivariate random vectors. In this paper, we establish a refined Cramér type moderate deviation theorem for the general self-normalized sum \sum_{i=1}^n X_i/(\sum_{i=1}^n Y_i^2)^{1/2}, which unifies and extends the classical Cramér (1938) theorem and the self-normalized Cramér type moderate deviation theorems by Jing, Shao and Wang (2003) as well as the further refined version by Wang (2011). The advantage of our result is evidenced through successful applications to weakly dependent random variables and self-normalized winsorized mean. Speci…
In this paper we present a tail inequality for the maximum of partial sums of a weakly dependent sequence of random variables that are not necessarily bounded. The class considered includes geometrically and subgeometrically strongly mixing sequences. The result is then used to derive asymptotic moderate deviations results. Applications include classes of Markov chains, functions of linear processes with absolutely regular innovations and ARCH models
In this paper we obtain a Bernstein type inequality for a class of weakly dependent and bounded random variables. The proofs lead to a moderate deviations principle for sums of bounded random variables with exponential decay of the strong mixing coeficients that complements the large deviation result obtained by Bryc and Dembo (1998) under superexponential mixing rates.
We establish Cramér-type moderate deviation theorems for sums of locally dependent random variables and combinatorial central limit theorems. Under some mild exponential moment conditions, optimal error bounds and convergence ranges are obtained. Our main results are more general or shaper than the existing results in the literature. The main results follows from a more general Cramér-type moderate deviation theorem for dependent random variables without any boundedness assumptions, which is of independent interest. The proofs couple Stein's method with a recursive argument.
We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with Pareto-like distribution tails. We show that $s=\lim_{x\to \infty} \frac{-\log P(W>x)}{\log x}$ is a monotonically decreasing characteristic of the input noise, and hence can serve as a measure of its strength in the model. Heuristically, the heavy-taliped limiting distribution, versus a light-tailed one with $s=+\infty,$ can be interpreted as an evidence support…
We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,π]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random variables. In this note, we provide estimates for the probability that the sum of independent monotone integer variables attains precisely a specific value. We do not assume that the variables are identically distributed. Our estimates are sharp when the specific value is close to the mean, but they are not useful further out in the tail. By combining with the …
The Moderate Deviations Principle (MDP) is well-understood for sums of independent random variables, worse understood for stationary random sequences, and scantily understood for random fields. An upper bound for a new class of random fields is obtained here by induction in dimension. Version 3. Sect 1. Stationarity, being not essential in the proofs, is removed from the definitions and the main result formulation. Sect. 2. $[C,2C]$ instead of $[C_1,2C_1]$ before Prop. 2.6; $ a\ge1$ instead of $a\ge C/C_1$ in the last proof; Remark 2.5 added; supremum over shifts in (2.2) (formerly (2.3)); "ce…
The sub-linear expectation or called G-expectation is a nonlinear expectation having advantage of modeling non-additive probability problems and the volatility uncertainty in finance. Let $\{X_n;n\ge 1\}$ be a sequence of independent random variables in a sub-linear expectation space $(Ω, \mathscr{H}, \widehat{\mathbb E})$. Denote $S_n=\sum_{k=1}^n X_k$ and $V_n^2=\sum_{k=1}^n X_k^2$. In this paper, a moderate deviation for self-normalized sums, that is, the asymptotic capacity of the event $\{S_n/V_n \ge x_n \}$ for $x_n=o(\sqrt{n})$, is found both for identically distributed random variables…
Exact exponential tail estimation for sums of independent centered random variables, under natural norming, with applications to the theory of U-statistics
本文利用 GLS 理论推导自然规范化独立中心化随机变量之和的精确指数尾部,并给出 U 统计量中的精细尾部估计。
We derive the exponential as well as power decreasing tail estimations for normed sums of centered independent identical distributed (or not) random variables on the Khintchine's form. We consider arbitrary, in particular, non-Rademacher's variables and not only Lebesgue-Riesz rearrangement invariant norms for the random variables. We intend to calculate the value of correspondent limit.
We use a new method via $p$-Wasserstein bounds to prove Cramér-type moderate deviations in (multivariate) normal approximations. In the classical setting that $W$ is a standardized sum of $n$ independent and identically distributed (i.i.d.) random variables with sub-exponential tails, our method recovers the optimal range of $0\leq x=o(n^{1/6})$ and the near optimal error rate $O(1)(1+x)(\log n+x^2)/\sqrt{n}$ for $P(W>x)/(1-Φ(x))\to 1$, where $Φ$ is the standard normal distribution function. Our method also works for dependent random variables (vectors) and we give applications to the combinat…
We prove moderate deviations bounds for the lower tail of the number of odd cycles in a $\calG(n, m)$ random graph. We show that the probability of decreasing triangle density by $t^3$, is $\exp(-Θ(n^2 t^2))$ whenever $n^{-3/4} \ll t^3 \ll 1$, while for $k \ge 5$ we give the same estimate for the probability of decreasing the $k$-cycle density by $t^k$, but for the larger range $n^{-1} \ll t^k \ll 1$. When $m \ge \frac 12 \binom n2$, we also find the leading coefficient in the exponent. This complements results of Goldschmidt et al., who showed that for $n^{-3/2} \ll t^k \ll n^{-1}$, the proba…
The Moderate Deviations Principle (MDP) is well-understood for sums of independent random variables, worse understood for stationary random sequences, and scantily understood for random fields. Here it is established for some planary random fields of the form $ X_t = ψ(G_t) $ obtained from a Gaussian random field $ G_t $ via a function $ ψ$, and consequently, for zeroes of the Gaussian Entire Function. Version 2: Appendix "Reader's guide to parts I-V" added. Minor changes, as follows. Formulations corrected: (2.1), 3.12(b), 4.5. Proofs corrected: 2.5, 2.6, 3.12, 3.16, 3.19, 4.13, 4.14, 4.15, 5…
The exact expression for the probability density $p_{_N}(x)$ for sums of a finite number $N$ of random independent terms is obtained. It is shown that the very tail of $p_{_N}(x)$ has a Gaussian form if and only if all the random terms are distributed according to the Gauss Law. In all other cases the tail for $p_{_N}(x)$ differs from the Gaussian. If the variances of random terms diverge the non-Gaussian tail is related to a Levy distribution for $p_{_N}(x)$. However, the tail is not Gaussian even if the variances are finite. In the latter case $p_{_N}(x)$ has two different asymptotics. At sm…
We derive a Gaussian approximation result for the maximum of a sum of high-dimensional random vectors. Specifically, we establish conditions under which the distribution of the maximum is approximated by that of the maximum of a sum of the Gaussian random vectors with the same covariance matrices as the original vectors. This result applies when the dimension of random vectors ($p$) is large compared to the sample size ($n$); in fact, $p$ can be much larger than $n$, without restricting correlations of the coordinates of these vectors. We also show that the distribution of the maximum of a sum…
Let $X_1,\dots,X_n$ be independent nonnegative random variables (r.v.'s), with $S_n:=X_1+\dots+X_n$ and finite values of $s_i:=E X_i^2$ and $m_i:=E X_i>0$. Exact upper bounds on $E f(S_n)$ for all functions $f$ in a certain class $\mathcal{F}$ of nonincreasing functions are obtained, in each of the following settings: (i) $n,m_1,\dots,m_n,s_1,\dots,s_n$ are fixed; (ii) $n$, $m:=m_1+\dots+m_n$, and $s:=s_1+\dots+s_n$ are fixed; (iii)~only $m$ and $s$ are fixed. These upper bounds are of the form $E f(η)$ for a certain r.v. $η$. The r.v. $η$ and the class $\mathcal{F}$ depend on the choice of on…
We propose a novel complex-analytic method for sums of i.i.d. random variables that are heavy-tailed and integer-valued. The method combines singularity analysis, Lindelöf integrals, and bivariate saddle points. As an application, we prove three theorems on precise large and moderate deviations which provide a local variant of a result by S. V. Nagaev (1973). The theorems generalize five theorems by A. V. Nagaev (1968) on stretched exponential laws $p(k) = c\exp( -k^α)$ and apply to logarithmic hazard functions $c\exp( - (\log k)^β)$, $β>2$; they cover the big jump domain as well as the small …