自正则Chung型重对数律的精确渐近性

设X,X_1,X_2,…为零均值、非退化、吸引域为正态吸引场的独立同分布随机变量序列,记S_n=■X_j,M_n=■|S_k|,V_n~2=■X_j~2,n≥1.证明了当b>-1时,■δ~(-2(b 1))■(log log n)~P/(n log n)P(Mn/V_n≤ε~(π~2)/(8lgo log n)~(1/2)) =4/πГ(b 1)■~(-1)~k/(2k 1)~(2b 3).     

Precise asymptotics in the deviation probability series of self-normalized sums

Let X,X₁,X₂,… be a sequence of nondegenerate i.i.d. random variables with zero means. Set Sn=X₁+?+Xn and . In the present paper we examine the precise asymptotic behavior for the general deviation probabilities of self-normalized sums, Sn/Wn. For positive functions g(x), ?(x), α(x) and κ(x), we obtain the precise asymptotics for the following deviation probabilities of self-normalized sums:

     

On the LIL for Self-Normalized Sums of IID Random Variables

Let be i.i.d. random variables and let, for each and . It is shown that a.s. whenever the sequence of self-normalized sums S _n /V _n is stochastically bounded, and that this limsup is a.s. positive if, in addition, X is in the Feller class. It is also shown that, for X in the Feller class, the sequence of self-normalized sums is stochastically bounded if and only if      

An almost sure central limit theorem for self-normalized products of sums of i.i.d. random variables

Let X,X₁,X₂,… be a sequence of independent and identically distributed positive random variables with EX=μ>0. In this paper we show that the almost sure central limit theorem for self-normalized products of sums holds only under the assumptions that X belongs to the domain of attraction of the normal law.     

Cluster Sets of Self-Normalized Sums

We determine the cluster sets of certain self-normalized sums of i.i.d. random variables. In the process, we obtain a refined large deviation result for sums in the domain of attraction of a stable law.     

Self-Normalized LIL for Hanson–Russo Type Increments

Let X ₁, X ₂,... be independent, but not necessarily identically distributed random variables in the domain of attraction of a normal law or a stable law with index 0 < α < 2. Using suitable self-normalizing (or Studentizing) factors, laws of the iterated logarithm for self-normalized Hanson–Russo type increments are discussed. Also, some analogous results for self-normalized weighted sums of i.i.d. random variables are given.     

Relation between the rate of convergence of strong law of large numbers and the rate of concentration of Bayesian prior in game-theoretic probability

We study the behavior of the capital process of a continuous Bayesian mixture of fixed proportion betting strategies in the one-sided unbounded forecasting game in game-theoretic probability. We establish the relation between the rate of convergence of the strong law of large numbers in the self-normalized form and the rate of divergence to infinity of the prior density around the origin. In particular we present prior densities ensuring the validity of Erd?s–Feller–Kolmogorov–Petrowsky law of the iterated logarithm.     

Asymptotics for self-normalized random products of sums of i.i.d. random variables

Let be a sequence of independent and identically distributed positive random variables, which is in the domain of attraction of the normal law, and tn be a positive, integer random variable. Denote , , where denotes the sample mean. Then we show that the self-normalized random product of the partial sums, , is still asymptotically lognormal under a suitable condition about tn.     

Exact inequalities for sums of asymmetric random variables, with applications

Let be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter . Let if and . Let . Let f be such a function that f and f′′ are nondecreasing and convex. Then it is proved that for all nonnegative numbers one has the inequality where . The lower bound on m is exact for each . Moreover, is Schur-concave in . A number of corollaries are obtained, including upper bounds on generalized moments and tail probabilities of (super)martingales with differences of bounded asymmetry, and also upper bounds on the maximal function of such (super)martingales. Applications to generalized self-normalized sums and t-statistics are given.      

Nonparametric regression with martingale increment errors

We consider the problem of adaptive estimation of the regression function in a framework where we replace ergodicity assumptions (such as independence or mixing) by another structural assumption on the model. Namely, we propose adaptive upper bounds for kernel estimators with data-driven bandwidth (Lepski’s selection rule) in a regression model where the noise is an increment of martingale. It includes, as very particular cases, the usual i.i.d. regression and auto-regressive models. The cornerstone tool for this study is a new result for self-normalized martingales, called “stability”, which is of independent interest. In a first part, we only use the martingale increment structure of the noise. We give an adaptive upper bound using a random rate, that involves the occupation time near the estimation point. Thanks to this approach, the theoretical study of the statistical procedure is disconnected from usual ergodicity properties like mixing. Then, in a second part, we make a link with the usual minimax theory of deterministic rates. Under a β-mixing assumption on the covariates process, we prove that the random rate considered in the first part is equivalent, with large probability, to a deterministic rate which is the usual minimax adaptive one.