The Berry-Esseen bound for Studentized U-statistics

Callaert and Veraverbeke (1981) recently obtained a Berry-Esseen-type bound of order n^–1/2 for Studentized nondegenerate U-statistics of degree two. The condition these authors need to obtain this order bound is the finiteness of the 4.5th absolute moment of the kernel h. In this note it is shown that this assumption can be weakened to that of a finite (4 + ?)th absolute moment of the kernel h, for some ? > 0. Our proof resembles part of Helmers and van Zwet (1982), where an analogous result is obtained for the Student t-statistic. The present note extends this to Studentized U-statistics.     

A note on the almost sure central limit theorem for the product of partial sums of m-dependent random variables

We present an almost sure central limit theorem for the product of the partial sums of m-dependent random variables. In order to obtain the main result, we prove a corresponding almost sure central limit theorem for a triangular array.     

An extension of almost sure central limit theorem for the maximum of stationary Gaussian random fields

Let X₁, X₂, … be a sequence of stationary standardized Gaussian random fields. The almost sure limit theorem for the maxima of stationary Gaussian random fields is established. Our results extend and improve the results in Csáki and Gonchigdanzan (2002 Csáki, E., Gonchigdanzan, K. (2002). Almost sure limit theorems for the maximum of stationary Gaussian sequences. Stat. Probab. Lett. 58:195–203.[Crossref], [Web of Science ®] , [Google Scholar]) and Choi (2010 Choi, H. (2010). Almost sure limit theorem for stationary Gaussian random fields. J. Korean Stat. Soc. 39:449–454.[Crossref], [Web of Science ®] , [Google Scholar]).     

On the asymptotic normality of functions of uniform spacings

A new proof is given for the asymptotic normality of sum functions of spacings, providing an alternative to the method of Le Cam (1958). The result is obtained under an optimal moment condition. The proof is based on a simple decomposition into a leading term, which is asymptotically normal, and a remainder term, which is shown to be negligible.     

On rates of convergence to infinitely divisible laws for dependent random variables

Large O and small o approximations of the expected value of a class of functions (modified K-functional and Lipschitz class) of the normalized partial sums of dependent random variables by the expectation of the corresponding functions of infinitely divisible random variables have been established. As a special case, we have obtained rates of convergence to the Stable Limit Laws and to the Weak Laws of Large Numbers. The technique used is the conditional version of the operator method of Trotter and the Taylor expansion.     

Model-based confidence bands for survival functions

This paper focuses on a novel method of developing one-sample confidence bands for survival functions from right censored data. The approach is model-based, relying on a parametric model for the conditional expectation of the censoring indicator given the observed minimum, and derives its strength from easy access to a good-fitting model among a plethora of choices available for binary response data. The substantive methodological contribution is in exploiting a semiparametric estimator of the survival function to produce improved simultaneous confidence bands. To obtain critical values for computing the confidence bands, a two-stage bootstrap approach that combines the classical bootstrap with the more recent model-based regeneration of censoring indicators is proposed and a justification of its asymptotic validity is also provided. Several different confidence bands are studied using the proposed approach. Numerical studies, including robustness of the proposed bands to misspecification, are carried out to check efficacy. The method is illustrated using two lung cancer data sets.     

Central limit theorem for the empirical process of a linear sequence with long memory

We discuss the functional central limit theorem (FCLT) for the empirical process of a moving-average stationary sequence with long memory. The cases of one-sided and double-sided moving averages are discussed. In the case of one-sided (causal) moving average, the FCLT is obtained under weak conditions of smoothness of the distribution and the existence of (2+δ)-moment of i.i.d. innovations, by using the martingale difference decomposition due to Ho and Hsing (1996, Ann. Statist. 24, 992–1014). In the case of double-sided moving average, the proof of the FCLT is based on an asymptotic expansion of the bivariate probability density.     

On the functional central limit theorem for first passage time of nonlinear semi-Markov reward processes

Abstract

In this article we examine the functional central limit theorem for the first passage time of reward processes defined over a finite state space semi-Markov process. In order to apply this process for a wider range of real-world applications, the reward functions, considered in this work, are assumed to have general forms instead of the constant rates reported in the other studies. We benefit from the martingale theory and Poisson equations to prove and establish the convergence of the first passage time of reward processes to a zero mean Brownian motion. Necessary conditions to derive the results presented in this article are the existence of variances for sojourn times in each state and second order integrability of reward functions with respect to the distribution of sojourn times. We finally verify the presented methodology through a numerical illustration.     

An extension of almost sure central limit theorem for self-normalized products of sums for mixing sequences

ABSTRACT

Let X, X₁, X₂, … be a sequence of strictly stationary φ-mixing random variables with EX = μ > 0. In this paper, we show that a self-normalized version of almost sure central limit theorem (ASCLT) holds under the assumptions that the mixing coefficients satisfy ∑^∞_{n = 1}φ^1/2(2ⁿ) < ∞ and the weight sequence {d_k} satisfies a mild growth condition similar to Kolmogorov’s condition for the LIL. This shows that logarithmic averages, used traditionally in ASCLT for products of sums, can be replaced by other averages, leading to considerably sharper results.     

On Esseen type inequalities for combinatorial random sums

We derive new bounds of the remainder in a combinatorial central limit theorem with a random number of summands. Esseen type inequalities are obtained for random combinatorial sums. Various moment conditions are considered. Moments of order 2 + δ, δ ∈ (0, 1], are partial cases. A variant of a combinatorial central limit theorem is proved for random sums with indices having Poisson distributions.     

Non uniform bound on a combinatorial central limit theorem

ABSTRACT

In this paper, we give a non uniform bound on combinatorial central limit theorem by using Stein’s method. This improves the result of Neammanee and Rattanawong (2009 Neammanee, K., Rattanawong, P. (2009). Non-uniform bound on normal approximation of Latin hypercube sampling. JMR 1:28–42. [Google Scholar]) from the finiteness of the sixth moment to the finiteness of the third moment.     

A general result in almost sure central limit theory for random fields

In this note, we investigate, under some mild conditions, the almost sure central limit theorem for random fields with general weight sequences.     

Tests for high-dimensional covariance matrices using the theory of U-statistics

Test statistics for sphericity and identity of the covariance matrix are presented, when the data are multivariate normal and the dimension, p, can exceed the sample size, n. Under certain mild conditions mainly on the traces of the unknown covariance matrix, and using the asymptotic theory of U-statistics, the test statistics are shown to follow an approximate normal distribution for large p, also when p?n. The accuracy of the statistics is shown through simulation results, particularly emphasizing the case when p can be much larger than n. A real data set is used to illustrate the application of the proposed test statistics.     

A uniform central limit theorem for neural network-based autoregressive processes with applications to change-point analysis

We consider an autoregressive process with a nonlinear regression function that is modelled by a feedforward neural network. First, we derive a uniform central limit theorem which is useful in the context of change-point analysis. Then, we propose a test for a change in the autoregression function which – by the uniform central limit theorem – has asymptotic power one for a large class of alternatives including local alternatives not restricted to the correctly specified model.     

Limit theorems for dependent Bernoulli variables with statistical inference

We consider a class of dependent Bernoulli variables where the conditional success probability is a linear combination of the last few trials and the original success probability. We obtain its limit theorems including the strong law of large numbers, weak invariance principle, and law of the iterated logarithm. We also derive some statistical inference results which make the model applicable. Simulation results are exhibited as well to show that with small sample size the convergence rate is satisfying and the proposed estimators behave well.     

Estimation of extinction probability of a multitype markov branching process

Maximum likelihood estimation of the probability of ultimate extinction of a multitype Markov branching process is studied when the process is observed completely over a fixed time interval [0,t]. The asymptotic properties of the estimator are discussed.     

An improvement of a non-uniform bound for combinatorial central limit theorem

In this article, we develop a new Rosenthal Inequality for uniform random permutation sums of random variables with finite third moments and apply it to obtain a sharp non-uniform bound for the combinatorial central limit theorem using the Stein's method and the exchangeable pair techniques. The obtained bound is shown to be sharper than other existing bounds.