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.     

Detecting outliers in GARCH(p,q) models

This article is concerned with the outliers in GARCH models. An iterative procedure is given for testing the presence of any type of the four common outliers. Since the distribution of test statistic cannot be obtained analytically, its distributional behavior is investigated via a simulation study. The simulation study is based on estimation of residuals standard deviation (σ_ν), which are obtained using two methods, median absolute deviation method (MAD), and omit-one method. The proposed procedure is employed for testing the presence of outliers in weekly light oil price Indexes of Iran during 1997 to 2010.     

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.     

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.     

Dependent Lindeberg central limit theorem for the fidis of empirical processes of cluster functionals

Drees H. and Rootzén H. [Limit theorems for empirical processes of cluster functionals (EPCF). Ann Stat. 2010;38(4):2145–2186] have proven central limit theorems (CLTs) for EPCF built from β-mixing processes. However, this family of β-mixing processes is quite restrictive. We expand some of those results, for the finite-dimensional marginal distributions (fidis), to a more general dependent processes family, known as weakly dependent processes in the sense of Doukhan P. and Louhichi S. [A new weak dependence condition and applications to moment inequalities. Stoch. Proc. Appl. 1999;84:313–342]. In this context, the CLT for the fidis of EPCF is sufficient in some applications. For instance, we prove the convergence without mixing conditions of the extremogram estimator, including a small example with simulation of the extremogram of a weakly dependent random process but nonmixing, in order to confirm the efficacy of our result.     

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.     

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.     

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.     

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]).     

Invariance principles and almost sure central limit theorem for the error variance estimator in linear models

A number of score statistics are derived for a heterogeneous spatial Poisson process which has a composite intensity. The intensity consists of a 'background' process which is estimated

from a control point process by kernel density estimation. The parametric form of the composite intensity yields score tests for particular spatial effects. A numerical example concerning respiratory cancer mortality is given.     

Deviation of order p for estimators of the variance in first-order stochastic differential equation (SDE)

In this work, we consider a non-parametric estimator of the variance in one-dimensional diffusion models or, more generally, in Itô processes with a deterministic diffusion term and a general non-anticipative drift. The estimation is based on the quadratic variation of discrete time observations over a finite interval. In particular, a central limit theorem (CLT) is proved for the deviation in L ^p norm (p≥; 1) between the variance and this estimator. The method of the proof consists in writing the L ^p norm of the deviation, when the drift term is equal to zero, as a sum of 4-dependent random variables. The moments are then computed by means of a Gaussian approximation and a CLT for m-dependent random variables is applied. The convergence is stable in law, this allows the result for processes with general drifts to be obtained, by using Girsanov's formula.     

A general central limit theorem and a subsampling variance estimator for α‐mixing point processes

We establish a central limit theorem for multivariate summary statistics of nonstationary α‐mixing spatial point processes and a subsampling estimator of the covariance matrix of such statistics. The central limit theorem is crucial for establishing asymptotic properties of estimators in statistics for spatial point processes. The covariance matrix subsampling estimator is flexible and model free. It is needed, for example, to construct confidence intervals and ellipsoids based on asymptotic normality of estimators. We also provide a simulation study investigating an application of our results to estimating functions.     

An almost sure central limit theorem for self-normalized partial sums of weakly dependent random variables

Abstract

We give here an almost sure central limit theorem for self-normalized partial sums of a strictly stationary φ-mixing sequences which is in the domain of attraction of the normal law with mean zero and possibly infinite variance. Our result substantially extend a result on the almost sure central limit theorem previously obtained by Huang and Pang (2010).     

Interval Estimation for the Sortino Ratio and the Omega Ratio

In this article, asymptotic confidence intervals (CIs) for the Sortino and Omega ratios are proposed and analyzed. First, the CIs are derived under the assumption of temporal independence and identical distribution of returns. Later they are obtained assuming that the returns process is strictly stationary and α-mixing of a certain size. In order to evaluate the minimum sample size for a good coverage accuracy of the asymptotic CIs, a simulation study is performed. It is obtained that the minimum sample sizes are very high, especially under the more realistic assumption of not-iid returns.     

Estimation and Asymptotic Properties in Periodic GARCH(1, 1) Models

This article studies the probabilistic structure and asymptotic inference of the first-order periodic generalized autoregressive conditional heteroscedasticity (PGARCH(1, 1)) models in which the parameters in volatility process are allowed to switch between different regimes. First, we establish necessary and sufficient conditions for a PGARCH(1, 1) process to have a unique stationary solution (in periodic sense) and for the existence of moments of any order. Second, using the representation of squared PGARCH(1, 1) model as a PARMA(1, 1) model, we then consider Yule-Walker type estimators for the parameters in PGARCH(1, 1) model and derives their consistency and asymptotic normality. The estimator can be surprisingly efficient for quite small numbers of autocorrelations and, in some cases can be more efficient than the least squares estimate (LSE). We use a residual bootstrap to define bootstrap estimators for the Yule-Walker estimates and prove the consistency of this bootstrap method. A set of numerical experiments illustrates the practical relevance of our theoretical results.     

Inference for the tail index of a GARCH(1,1) model and an AR(1) model with ARCH(1) errors

For a GARCH(1,1) sequence or an AR(1) model with ARCH(1) errors, one can estimate the tail index by solving an estimating equation with unknown parameters replaced by the quasi maximum likelihood estimation, and a profile empirical likelihood method can be employed to effectively construct a confidence interval for the tail index. However, this requires that the errors of such a model have at least a finite fourth moment. In this article, we show that the finite fourth moment can be relaxed by employing a least absolute deviations estimate for the unknown parameters by noting that the estimating equation for determining the tail index is invariant to a scale transformation of the underlying model.