Prediction intervals for farima processes by bootstrap methods

In this paper we introduce a procedure to compute prediction intervals for FARIMA (p d q) processes, taking into account the variability due to model identification and parameter estimation. To this aim, a particular bootstrap technique is developed. The performance of the prediction intervals is then assessed and compared to that of stand­ard bootstrap percentile intervals. The methods are applied to the time series of Nile River annual minima.     

Maximum likelihood estimation for arma models in the presence of ARMA errors

An ARMA(p, q) process observed with an ARMA(c, d) error has an ARMA (p + c, k) representation with k = max(c + q, p + d) whose parameters satisfy some nonlinear constraints. Identification of the model is discussed. We develop Newton-Raphson estimators for the ARMA(p + c, k) process which take advantage of the information contained in the nonlinear restrictions. Explicit expressions for the derivatives of the restrictions are derived.     

Parametric estimation for ARFIMA models via spectral methods

Given a fractional integrated, autoregressive, moving average,ARFIMA (p, d, q) process, the simultaneous estimation of the short and long memory parameters can be achieved by maximum likelihood estimators. In this paper, following a two-step algorithm, the coefficients are estimated combining the maximum likelihood estimators with the general orthogonal decomposition of stochastic processes. In particular, the principal component analysis of stochastic processes is exploited to estimate the short memory parameters, which are plugged into the maximum likelihood function to obtain the fractional differencingd.     

Asymptotic Results for Spatial ARMA Models

Causal quadrantal-type spatial ARMA(p, q) models with independent and identically distributed innovations are considered. In order to select the orders (p, q) of these models and estimate their autoregressive parameters, estimators of the autoregressive coefficients, derived from the extended Yule–Walker equations are defined. Consistency and asymptotic normality are obtained for these estimators. Then, spatial ARMA model identification is considered and simulation study is given.     

M‐estimation for general ARMA Processes with Infinite Variance

Abstract. General autoregressive moving average (ARMA) models extend the traditional ARMA models by removing the assumptions of causality and invertibility. The assumptions are not required under a non‐Gaussian setting for the identifiability of the model parameters in contrast to the Gaussian setting. We study M‐estimation for general ARMA processes with infinite variance, where the distribution of innovations is in the domain of attraction of a non‐Gaussian stable law. Following the approach taken by Davis et al. (1992) and Davis (1996) , we derive a functional limit theorem for random processes based on the objective function, and establish asymptotic properties of the M‐estimator. We also consider bootstrapping the M‐estimator and extend the results of Davis & Wu (1997) to the present setting so that statistical inferences are readily implemented. Simulation studies are conducted to evaluate the finite sample performance of the M‐estimation and bootstrap procedures. An empirical example of financial time series is also provided.     

Probabilistic Properties of Parametric Dual and Inverse Time Series Models Generated by ARMA Models

For the class of autoregressive-moving average (ARMA) processes, we examine the relationship between the dual and the inverse processes. It is demonstrated that the inverse process generated by a causal and invertible ARMA (p, q) process is a causal and invertible ARMA (q, p) model. Moreover, it is established that this representation is strong if and only if the generating process is Gaussian. More precisely, it is derived that the linear innovation process of the inverse process is an all-pass model. Some examples and applications to time reversibility are given to illustrate the obtained results.     

Euler(p,q) Processes and Their Application to Non Stationary Time Series with Time Varying Frequencies

We introduce Euler(p, q) processes as an extension of the Euler(p) processes for purposes of obtaining more parsimonious models for non stationary processes whose periodic behavior changes approximately linearly in time. The discrete Euler(p, q) models are a class of multiplicative stationary (M-stationary) processes and basic properties are derived. The relationship between continuous and discrete mixed Euler processes is shown. Fundamental to the theory and application of Euler(p, q) processes is a dual relationship between discrete Euler(p, q) processes and ARMA processes, which is established. The usefulness of Euler(p, q) processes is examined by comparing spectral estimation with that obtained by existing methods using both simulated and real data.     

Bayesian inference and forecasting in the stationary bilinear model

A stationary bilinear (SB) model can be used to describe processes with a time-varying degree of persistence that depends on past shocks. This study develops methods for Bayesian inference, model comparison, and forecasting in the SB model. Using monthly U.K. inflation data, we find that the SB model outperforms the random walk, first-order autoregressive AR(1), and autoregressive moving average ARMA(1,1) models in terms of root mean squared forecast errors. In addition, the SB model is superior to these three models in terms of predictive likelihood for the majority of forecast observations.     

Sieve bootstrapping the memory parameter in long-range dependent stationary functional time series

We consider a sieve bootstrap procedure to quantify the estimation uncertainty of long-memory parameters in stationary functional time series. We use a semiparametric local Whittle estimator to estimate the long-memory parameter. In the local Whittle estimator, discrete Fourier transform and periodogram are constructed from the first set of principal component scores via a functional principal component analysis. The sieve bootstrap procedure uses a general vector autoregressive representation of the estimated principal component scores. It generates bootstrap replicates that adequately mimic the dependence structure of the underlying stationary process. We first compute the estimated first set of principal component scores for each bootstrap replicate and then apply the semiparametric local Whittle estimator to estimate the memory parameter. By taking quantiles of the estimated memory parameters from these bootstrap replicates, we can nonparametrically construct confidence intervals of the long-memory parameter. As measured by coverage probability differences between the empirical and nominal coverage probabilities at three levels of significance, we demonstrate the advantage of using the sieve bootstrap compared to the asymptotic confidence intervals based on normality.

     

Bootstrap approaches for estimation and confidence intervals of long memory processes

In this work, we investigate an alternative bootstrap approach based on a result of Ramsey [F.L. Ramsey, Characterization of the partial autocorrelation function, Ann. Statist. 2 (1974), pp. 1296–1301] and on the Durbin–Levinson algorithm to obtain a surrogate series from linear Gaussian processes with long range dependence. We compare this bootstrap method with other existing procedures in a wide Monte Carlo experiment by estimating, parametrically and semi-parametrically, the memory parameter d. We consider Gaussian and non-Gaussian processes to prove the robustness of the method to deviations from normality. The approach is also useful to estimate confidence intervals for the memory parameter d by improving the coverage level of the interval.     

Statistical properties of detrended fluctuation analysis

The main goal of this work is to consider the detrended fluctuation analysis (DFA), proposed by Peng et al. [Mosaic organization of DNA nucleotides, Phys. Rev. E. 49(5) (1994), 1685–1689]. This is a well-known method for analysing the long-range dependence in non-stationary time series. Here we describe the DFA method and we prove its consistency and its exact distribution, based on the usual i.i.d. assumption, as an estimator for the fractional parameter d. In the literature it is well established that the nucleotide sequences present long-range dependence property. In this work, we analyse the long dependence property in view of the autoregressive moving average fractionally integrated ARFIMA(p, d, q) processes through the analysis of four nucleotide sequences. For estimating the fractional parameter d we consider the semiparametric regression method based on the periodogram function, in both classical and robust versions; the semiparametric R/S(n) method, proposed by Hurst [Long term storage in reservoirs, Trans. Am. Soc. Civil Eng. 116 (1986), 770–779] and the maximum likelihood method (see [R. Fox and M.S. Taqqu, Large-sample properties of parameter estimates for strongly dependent stationary Gaussian time series, Ann. Statist. 14 (1986), 517–532]), by considering the approximation suggested by Whittle [Hypothesis Testing in Time Series Analysis (1953), Hafner, New York].     

On the pade tablé and its relationship to the r and sarrays and arm a modeling

The Box-Jenkins method is a popular and important technique for modeling and forecasting of time series. Unfortunately the problem of determining the appropriate ARMA forecasting model (or indeed if an ARMA model holds) is a major drawback to the use of the Box-Jenkins methodology. Gray et al. (1978) and Woodward and Gray (1979) have proposed methods of estimating p and qin ARMA modeling based on the R and Sarrays that circumvent some of these modeling difficulties.

In this paper we generalize the R and S arrays by showing a relationship to Padé approximunts and then show that these arrays have a much wider application than in just determining model order. Particular non-ARMA models can be identified as well. This includes certain processes that consist of deterministic functions plus ARMA noise, indeed we believe that the combined R and S arrays are the best overall tool so fur developed for the identification of general 2nd order (not just stationary) time scries models.     

Valid Resampling of Higher-Order Statistics Using the Linear Process Bootstrap and Autoregressive Sieve Bootstrap

We show that the linear process bootstrap (LPB) and the autoregressive sieve bootstrap (AR sieve) are, in general, not valid for statistics whose large-sample distribution depends on moments of order higher than two, irrespective of whether the data come from a linear time series or not. Inspired by the block-of-blocks bootstrap, we circumvent this non-validity by applying the LPB and AR sieve to suitably blocked data and not to the original data itself. In a simulation study, we compare the LPB, AR sieve, and moving block bootstrap applied directly and to blocked data.     

Value-at-risk forecasting based on Gaussian mixture ARMA–GARCH model

In this paper, we develop a new forecasting algorithm for value-at-risk (VaR) based on ARMA–GARCH (autoregressive moving average–generalized autoregressive conditional heteroskedastic) models whose innovations follow a Gaussian mixture distribution. For the parameter estimation, we employ the conditional least squares and quasi-maximum-likelihood estimator (QMLE) for ARMA and GARCH parameters, respectively. In particular, Gaussian mixture parameters are estimated based on the residuals obtained from the QMLE of GARCH parameters. Our algorithm provides a handy methodology, spending much less time in calculation than the existing resampling and bias-correction method developed in Hartz et al. [Accurate value-at-risk forecasting based on the normal-GARCH model, Comput. Stat. Data Anal. 50 (2006), pp. 3032–3052]. Through a simulation study and a real-data analysis, it is shown that our method provides an accurate VaR prediction.     

Bootstrapping moving average models

Summary In recent years, the bootstrap method has been extended to time series analysis where the observations are serially correlated. Contributions have focused on the autoregressive model producing alternative resampling procedures. In contrast, apart from some empirical applications, very little attention has been paid to the possibility of extending the use of the bootstrap method to pure moving average (MA) or mixed ARMA models. In this paper, we present a new bootstrap procedure which can be applied to assess the distributional properties of the moving average parameters estimates obtained by a least square approach. We discuss the methodology and the limits of its usage. Finally, the performance of the bootstrap approach is compared with that of the competing alternative given by the Monte Carlo simulation. Research partially supported by CNR and MURST.     

ARFIMA processes and outliers: a weighted likelihood approach

In this paper, we consider the problem of robust estimation of the fractional parameter, d, in long memory autoregressive fractionally integrated moving average processes, when two types of outliers, i.e. additive and innovation, are taken into account without knowing their number, position or intensity. The proposed method is a weighted likelihood estimation (WLE) approach for which needed definitions and algorithm are given. By an extensive Monte Carlo simulation study, we compare the performance of the WLE method with the performance of both the approximated maximum likelihood estimation (MLE) and the robust M-estimator proposed by Beran (Statistics for Long-Memory Processes, Chapman & Hall, London, 1994). We find that robustness against the two types of considered outliers can be achieved without loss of efficiency. Moreover, as a byproduct of the procedure, we can classify the suspicious observations in different kinds of outliers. Finally, we apply the proposed methodology to the Nile River annual minima time series.     

Bootstrap test of goodness of fit to a linear model when errors are correlated

Given the regression model Y_i = m(x_i) +ε_i (x_i ε C, i = l,…,n, C a compact set in R) where m is unknown and the random errors {ε_i} present an ARMA structure, we design a bootstrap method for testing the hypothesis that the regression function follows a general linear model: H_o : m ε {mθ(.) = A^t(.)θ : θ ε ? ? R^q} with A a functional from R to R^q. The criterion of the test derives from a Cramer-von-Mises type functional distance D = d²([mcirc]_n, A^t(.)θ_n), between [mcirc]_n, a Gasser-Miiller non-parametric estimator of m, and the member of the class defined in H_o that is closest to m_n in terms of this distance. The consistency of the bootstrap distribution of D and θ_n is obtained under general conditions. Finally, simulations show the good behavior of the bootstrap approximation with respect to the asymptotic distribution of D = d².     

On the invertibility conditions for moving average processes

Conditions for the general Moving Average process, of order q, to be invertible or borderline non-invertible are deduced. These are termed the acceptability conditions. It turns out that they depend on the magnitude of the final moving average parameter, θ _q . If ‖θ _q ‖ >1, the process is not acceptable. Should ‖θ _q ‖ = 1, the conditions, for any particular q, follow simply - if use is made of the remainder theorem. When ‖θ_q‖< 1, an appeal is made to ROUCH* E'S theorem, to establish the conditions. Analogous stationarity results immediately follow for autoregressive processes.     

Forecasting Vector ARMA Processes With Systematically Missing Observations

The following two predictors are compared for time series with systematically missing observations: (a) A time series model is fitted to the full series X_t , and forecasts are based on this model, (b) A time series model is fitted to the series with systematically missing observations Y _τ, and forecasts are based on the resulting model. If the data generation processes are known vector autoregressive moving average (ARMA) processes, the first predictor is at least as efficient as the second one in a mean squared error sense. Conditions are given for the two predictors to be identical. If only the ARMA orders of the generation processes are known and the coefficients are estimated, or if the process orders and coefficients are estimated, the first predictor is again, in general, superior. There are, however, exceptions in which the second predictor, using seemingly less information, may be better. These results are discussed, using both asymptotic theory and small sample simulations. Some economic time series are used as illustrative examples.     

Strong consistency of the regularized least-squares estimates of infinite autoregressive models

Our main interest is on-line parameter estimation of infinite AR models with exponentially decaying coefficients. The practical importance of the problem follows from the fact that the class of such models includes (but not limited to) all causal invertible ARMA(p,q$p,q$) models. On-line parameter estimation means that the length of the observed data sample is not known a priori and may indefinitely increase. Hence, the parameter estimates should be refined upon arrival of every new observation. So use of the maximum likelihood (ML) method is not feasible due to the high computational burden, and recursive estimation procedures are preferable.