Efficient computation of the discrete autocorrelation wavelet inner product matrix

Discrete autocorrelation (a.c.) wavelets have recently been applied in the statistical analysis of locally stationary time series for local spectral modelling and estimation. This article proposes a fast recursive construction of the inner product matrix of discrete a.c. wavelets which is required by the statistical analysis. The recursion connects neighbouring elements on diagonals of the inner product matrix using a two-scale property of the a.c. wavelets. The recursive method is an (log (N)³) operation which compares favourably with the (N log N) operations required by the brute force approach. We conclude by describing an efficient construction of the inner product matrix in the (separable) two-dimensional case.     

Time varying long memory parameter estimation for locally stationary long memory processes

The semiparametric estimators of time varying long memory parameter are investigated for locally stationary long memory processes. The GPH estimator and the local Whittle estimator are considered. Under some mild regularity assumptions, the weak consistency and the asymptotic normality of the estimators are obtained. The finite sample performance of the estimators is discussed through a small simulation study.     

Uniform hypothesis testing for finite-valued stationary processes

Given a discrete-valued sample X₁, …, X_n, we wish to decide whether it was generated by a distribution belonging to a family H₀, or it was generated by a distribution belonging to a family H₁. In this work, we assume that all distributions are stationary ergodic, and do not make any further assumptions (e.g. no independence or mixing rate assumptions). We would like to have a test whose probability of error (both Types I and II) is uniformly bounded. More precisely, we require that for each ? there exists a sample size n such that probability of error is upper-bounded by ? for samples longer than n. We find some necessary and some sufficient conditions on H₀ and H₁ under which a consistent test (with this notion of consistency) exists. These conditions are topological, with respect to the topology of distributional distance.     

A remark on self-similar processes with stationary increments

The upper bound of the parameter of self-similar processes with stationary increments is given in terms of the moment condition.     

A wavelet-based time-varying autoregressive model for non-stationary and irregular time series

In this work we propose an autoregressive model with parameters varying in time applied to irregularly spaced non-stationary time series. We expand all the functional parameters in a wavelet basis and estimate the coefficients by least squares after truncation at a suitable resolution level. We also present some simulations in order to evaluate both the estimation method and the model behavior on finite samples. Applications to silicates and nitrites irregularly observed data are provided as well.     

A note on general quadratic forms of nonstationary stochastic processes

In this paper, general quadratic forms of nonstationary, α-mixing time series are considered. Under mixing and moment assumptions, asymptotically normality of these forms are derived. These results do not assume that the variance of the generalized quadratic form has a limit, thus allowing for general types of nonstationarity. However, without well-defined limits, it is not possible to understand the differences in sampling properties of quadratic forms of nonstationary and stationary processes. To understand these differences, the nonstationary process is placed within the locally stationary framework. Under the assumption that the nonstationary process is locally stationary the asymptotic expectation and variance of the weighted sample covariance of the discrete Fourier transforms (an important class of quadratic forms) is derived and shown to be very different to its stationary counterpart.     

Nonparametric recursive estimation in stationary markov processes

This paper deals with a class of recursive kernel estimators of the transition probability density function t(y|x) of a stationary Markov process. A sufficient condition for such estimators to be weakly and strongly 2 consistent for almost all (x,y)∈R² is given. Further an L, convergence result is obtained. No continuity conditions are imposed on t(y|x).     

Optimal covariance estimation of discrete-time locally self-similar processes in time-scale and ambiguity domains

This paper investigates the optimal estimate of the covariance function in the sense of mean-square of errors, for the class of discrete-time locally self-similar processes. The covariance function is estimated in time-scale and ambiguity domains. Since the class of estimators is completely characterized in terms of kernels, the problem is reduced to finding the optimal kernel, which is obtained in time-scale domain. Also, the optimal kernel is computed for two classes of discrete-time locally self-similar and locally self-similar chirp processes. Furthermore, it is shown that the proposed method gives more accurate estimate than the ordinary methods for non stationary processes.     

Obtaining prediction intervals for FARIMA processes using the sieve bootstrap

The sieve bootstrap (SB) prediction intervals for invertible autoregressive moving average (ARMA) processes are constructed using resamples of residuals obtained by fitting a finite degree autoregressive approximation to the time series. The advantage of this approach is that it does not require the knowledge of the orders, p and q, associated with the ARMA(p, q) model. Up until recently, the application of this method has been limited to ARMA processes whose autoregressive polynomials do not have fractional unit roots. The authors, in a 2012 publication, introduced a version of the SB suitable for fractionally integrated autoregressive moving average (FARIMA (p,d,q)) processes with 0<d<0.5 and established its asymptotic validity. Herein, we study the finite sample properties this new method and compare its performance against an older method introduced by Bisaglia and Grigoletto in 2001. The sieve bootstrap (SB) method is a numerically simpler alternative to the older method which requires the estimation of p, d, and q at every bootstrap step. Monte-Carlo simulation studies, carried out under the assumption of normal, mixture of normals, and exponential distributions for the innovations, show near nominal coverages for short-term and long-term SB prediction intervals under most situations. In addition, the sieve bootstrap method yields better coverage and narrower intervals compared to the Bisaglia–Grigoletto method in some situations, especially when the error distribution is a mixture of normals.     

Wavelet processes and adaptive estimation of the evolutionary wavelet spectrum

This paper defines and studies a new class of non-stationary random processes constructed from discrete non-decimated wavelets which generalizes the Cramér (Fourier) representation of stationary time series. We define an evolutionary wavelet spectrum (EWS) which quantifies how process power varies locally over time and scale. We show how the EWS may be rigorously estimated by a smoothed wavelet periodogram and how both these quantities may be inverted to provide an estimable time-localized autocovariance. We illustrate our theory with a pedagogical example based on discrete non-decimated Haar wavelets and also a real medical time series example.     

Asymptotic behaviour of proportions of observations in random regions determined by central order statistics from stationary processes

In this paper, we show that proportions of observations that fall into a random region determined by a given Borel set and a central order statistic converge almost surely, provided that the corresponding population quantile is unique. We also describe three types of possible asymptotic behaviour of these proportions in the case of non-unique population quantile. As an application of our findings we establish limiting properties of numbers of ties with a central order statistics in a discrete sample. Our results are derived not only for independent and identically distributed observations but more generally for strictly stationary and ergodic sequences of random variables.     

Estimation using plug-in of the stationary distribution and Shannon entropy of continuous time Markov processes

A natural way to deal with the uncertainty of an ergodic finite state space Markov process is to investigate the entropy of its stationary distribution. When the process is observed, it becomes necessary to estimate this entropy.We estimate both the stationary distribution and its entropy by plug-in of the estimators of the infinitesimal generator. Three situations of observation are discussed: one long trajectory is observed, several independent short trajectories are observed, or the process is observed at discrete times. The good asymptotic behavior of the plug-in estimators is established. We also illustrate the behavior of the estimators through simulation.