Trimmed portmanteau test for linear processes with infinite variance

In this article, we consider a model check test for linear processes with infinite variance. As a test statistic, we employ the portmanteau test with trimmed residuals. It is shown that the limiting null distribution of the test is a chi-square distribution. Simulation results are provided for illustration.     

Offline and online weighted least squares estimation of nonstationary power ARCH processes

This paper proposes two estimation methods based on a weighted least squares criterion for non-(strictly) stationary power ARCH models. The weights are the squared volatilities evaluated at a known value in the parameter space. The first method is adapted for fixed sample size data while the second one allows for online data available in real time. It will be shown that these methods provide consistent and asymptotically Gaussian estimates having asymptotic variance equal to that of the quasi-maximum likelihood estimate (QMLE) regardless of the value of the weighting parameter. Finite-sample performances of the proposed WLS estimates are shown via a simulation study for various sub-classes of power ARCH models.     

Robust parameter estimation with a small bias against heavy contamination

In this paper we consider robust parameter estimation based on a certain cross entropy and divergence. The robust estimate is defined as the minimizer of the empirically estimated cross entropy. It is shown that the robust estimate can be regarded as a kind of projection from the viewpoint of a Pythagorean relation based on the divergence. This property implies that the bias caused by outliers can become sufficiently small even in the case of heavy contamination. It is seen that the asymptotic variance of the robust estimator is naturally overweighted in proportion to the ratio of contamination. One may surmise that another form of cross entropy can present the same behavior as that discussed above. It can be proved under some conditions that no cross entropy can present the same behavior except for the cross entropy considered here and its monotone transformation.     

Asymptotic properties of particle filter-based maximum likelihood estimators for state space models

We study the asymptotic performance of approximate maximum likelihood estimators for state space models obtained via sequential Monte Carlo methods. The state space of the latent Markov chain and the parameter space are assumed to be compact. The approximate estimates are computed by, firstly, running possibly dependent particle filters on a fixed grid in the parameter space, yielding a pointwise approximation of the log-likelihood function. Secondly, extensions of this approximation to the whole parameter space are formed by means of piecewise constant functions or B-spline interpolation, and approximate maximum likelihood estimates are obtained through maximization of the resulting functions. In this setting we formulate criteria for how to increase the number of particles and the resolution of the grid in order to produce estimates that are consistent and asymptotically normal.     

Asymptotic expansions in sequential estimation for the first-order random coefficient autoregressive model: Regenerative approach

Edgeworth expansions for the distribution of a sequential least squares estimator in the random coefficient autoregressive (RCA) model are derived. The regenerative approach to second-order asymptotic analysis of Markov-type statistical models is developed.     

Density estimation for linear processes

Summary LetX _t , ...,X _n be random variables forming a realization from a linear process where {Z _t } is a sequence of independent and identically distributed random variables with E|Z _t |<∞ for some ε>0, andg _r →0 asr→∞ at some specified rate. LetX ₁ have a probability density functionf. It is then established that for every realx, the standard kernel type estimator based onX _t (1≦t≦n) is, under some general regularity conditions, asymptotically normal and converges a.s. tof(x) asn→∞. Research was supported in part by the Air Force Office of Scientific Research Grant No. AFOSR-81-0058.     

On information pooling, adaptability and superefficiency in nonparametric function estimation

The connections between information pooling and adaptability as well as superefficiency are considered. Separable rules, which figure prominently in wavelet and other orthogonal series methods, are shown to lack adaptability; they are necessarily not rate-adaptive. A sharp lower bound on the cost of adaptation for separable rules is obtained. We show that adaptability is achieved through information pooling. A tight lower bound on the amount of information pooling required for achieving rate-optimal adaptation is given. Furthermore, in a sharp contrast to the separable rules, it is shown that adaptive non-separable estimators can be superefficient at every point in the parameter spaces. The results demonstrate that information pooling is the key to increasing estimation precision as well as achieving adaptability and even superefficiency.     

Exponential families of mixed Poisson distributions

If I=(I₁,…,I_d) is a random variable on [0,∞)^d with distribution μ(dλ₁,…,dλ_d), the mixed Poisson distribution MP(μ) on N^d is the distribution of (N₁(I₁),…,N_d(I_d)) where N₁,…,N_d are ordinary independent Poisson processes which are also independent of I. The paper proves that if F is a natural exponential family on [0,∞)^d then MP(F) is also a natural exponential family if and only if a generating probability of F is the distribution of v₀+v₁Y₁+?+v_qY_q for some q?d, for some vectors v₀,…,v_q of [0,∞)^d with disjoint supports and for independent standard real gamma random variables Y₁,…,Y_q.     

On functional limits of short- and long-memory linear processes with GARCH(1,1) noises

This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α$\alpha$ is in (0,2)$(0,2)$, equal to 2, and in (2,∞)$(2,\infty )$, respectively. The partial sum weakly converges to a functional of α$\alpha$-stable process when α<2$\alpha <2$ and converges to a functional of Brownian motion when α≥2$\alpha \ge 2$. When the process is of short-memory and α<4$\alpha <4$, the autocovariances converge to functionals of α/2$\alpha /2$-stable processes; and if α≥4$\alpha \ge 4$, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α$\alpha$ and β$\beta$ (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2$\alpha /2$-stable processes; (ii) Rosenblatt processes (indexed by β$\beta$, 1/2<β<3/4$1/2<\beta <3/4$); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α$\alpha$ and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1]$[0,1]$ with either (i) the _J1$J_1$ or the _M1$M_1$ topology (Skorokhod, 1956); or (ii) the weaker form S$S$ topology (Jakubowski, 1997). Some statistical applications are also discussed.     

The effect of memory on functional large deviations of infinite moving average processes

The large deviations of an infinite moving average process with exponentially light tails are very similar to those of an i.i.d. sequence as long as the coefficients decay fast enough. If they do not, the large deviations change dramatically. We study this phenomenon in the context of functional large, moderate and huge deviation principles.     

On weighting of bivariate margins in pairwise likelihood

Composite and pairwise likelihood methods have recently been increasingly used. For clustered data with varying cluster sizes, we study asymptotic relative efficiencies for various weighted pairwise likelihoods, with weight being a function of cluster size. For longitudinal data, we also study weighted pairwise likelihoods with weights that can depend on lag. Good choice of weights are needed to avoid the undesirable behavior of estimators with low efficiency. Some analytic results are obtained using the multivariate normal distribution. For clustered data, a practically good choice of weight is obtained after study of relative efficiencies for an exchangeable multivariate normal model; they are different from weights that had previously been suggested. For longitudinal data, there are advantages to only include bivariate margins of adjacent or nearly adjacent pairs in the weighted pairwise likelihood.     

Approximate martingale estimating functions for stochastic differential equations with small noises

An approximate martingale estimating function with an eigenfunction is proposed for an estimation problem about an unknown drift parameter for a one-dimensional diffusion process with small perturbed parameter ε$\epsilon$ from discrete time observations at n$n$ regularly spaced time points k/n$k/n$, k=0,1,…,n$k=0,1,\dots ,n$. We show asymptotic efficiency of an M$M$-estimator derived from the approximate martingale estimating function as ε→0$\epsilon \to 0$ and n→∞$n\to \infty$ simultaneously.     

Adaptive estimation of an ergodic diffusion process based on sampled data

We consider adaptive maximum likelihood type estimation of both drift and diffusion coefficient parameters for an ergodic diffusion process based on discrete observations. Two kinds of adaptive maximum likelihood type estimators are proposed and asymptotic properties of the adaptive estimators, including convergence of moments, are obtained.     

Jackknife-blockwise empirical likelihood methods under dependence

Empirical likelihood for general estimating equations is a method for testing hypothesis or constructing confidence regions on parameters of interest. If the number of parameters of interest is smaller than that of estimating equations, a profile empirical likelihood has to be employed. In case of dependent data, a profile blockwise empirical likelihood method can be used. However, if too many nuisance parameters are involved, a computational difficulty in optimizing the profile empirical likelihood arises. Recently, Li et al. (2011) [9] proposed a jackknife empirical likelihood method to reduce the computation in the profile empirical likelihood methods for independent data. In this paper, we propose a jackknife-blockwise empirical likelihood method to overcome the computational burden in the profile blockwise empirical likelihood method for weakly dependent data.     

Robust tests based on dual divergence estimators and saddlepoint approximations

This paper is devoted to robust hypothesis testing based on saddlepoint approximations in the framework of general parametric models. As is known, two main problems can arise when using classical tests. First, the models are approximations of reality and slight deviations from them can lead to unreliable results when using classical tests based on these models. Then, even if a model is correctly chosen, the classical tests are based on first order asymptotic theory. This can lead to inaccurate p-values when the sample size is moderate or small. To overcome these problems, robust tests based on dual divergence estimators and saddlepoint approximations, with good performances in small samples, are proposed.     

Change detection in autoregressive time series

Autoregressive time series models of order p have p+2 parameters, the mean, the variance of the white noise and the p autoregressive parameters. Change in any of these over time is a sign of disturbance that is important to detect. The methods of this paper can test for change in any one of these p+2 parameters separately, or in any collection of them. They are available in forms that make one-sided tests possible, furthermore, they can be used to test for a temporary change. The test statistics are based on the efficient score vector. The large sample properties of the change-point estimator are also explored.