Forecasting With Bayesian Vector Autoregressions—Five Years of Experience

The results obtained in five years of forecasting with Bayesian vector autoregressions (BVAR's) demonstrate that this inexpensive, reproducible statistical technique is as accurate, on average, as those used by the best known commercial forecasting services. This article considers the problem of economic forecasting, the justification for the Bayesian approach, its implementation, and the performance of one small BVAR model over the past five years.     

Testing for a Unit Root in a Time Series With a Changing Mean

This study considers testing for a unit root in a time series characterized by a structural change in its mean level. My approach follows the “intervention analysis” of Box and Tiao (1975) in the sense that I consider the change as being exogenous and as occurring at a known date. Standard unit-root tests are shown to be biased toward nonrejection of the hypothesis of a unit root when the full sample is used. Since tests using split sample regressions usually have low power, I design test statistics that allow the presence of a change in the mean of the series under both the null and alternative hypotheses. The limiting distribution of the statistics is derived and tabulated under the null hypothesis of a unit root. My analysis is illustrated by considering the behavior of various univariate time series for which the unit-root hypothesis has been advanced in the literature. This study complements that of Perron (1989), which considered time series with trends.     

Wild Bootstrap of the Sample Mean in the Infinite Variance Case

It is well known that the standard independent, identically distributed (iid) bootstrap of the mean is inconsistent in a location model with infinite variance (α-stable) innovations. This occurs because the bootstrap distribution of a normalised sum of infinite variance random variables tends to a random distribution. Consistent bootstrap algorithms based on subsampling methods have been proposed but have the drawback that they deliver much wider confidence sets than those generated by the iid bootstrap owing to the fact that they eliminate the dependence of the bootstrap distribution on the sample extremes. In this paper we propose sufficient conditions that allow a simple modification of the bootstrap (Wu, 1986 Wu , C. F. J. ( 1986 ). Jackknife, bootstrap, and other resampling methods . Annals of Statistics 14 : 1261 – 1295 .[Crossref], [Web of Science ®] , [Google Scholar]) to be consistent (in a conditional sense) yet to also reproduce the narrower confidence sets of the iid bootstrap. Numerical results demonstrate that our proposed bootstrap method works very well in practice delivering coverage rates very close to the nominal level and significantly narrower confidence sets than other consistent methods.     

Empirical bayes tests in a positive exponential family with partial information on priors

We investigate an empirical Bayes testing problem in a positive exponential family having pdf f{x/θ)=c(θ)u(x) exp(?x/θ), x>0, θ>0. It is assumed that θ is in some known compact interval [C₁, C₂]. The value C₁ is used in the construction of the proposed empirical Bayes test δ^* _n. The asymptotic optimality and rate of convergence of its associated Bayes risk is studied. It is shown that under the assumption that θ is in [C₁, C₂] δ^* _n is asymptotically optimal at a rate of convergence of order O(n^?1/n n). Also, δ^* _n is robust in the sense that δ^* _n still possesses the asymptotic optimality even the assumption that "C₁≦θ≦C₂ may not hold.     

SUFFICIENT CONDITIONS FOR A GEOMETRIC TAIL IN A QBD PROCESS WITH MANY COUNTABLE LEVELS AND PHASES

Abstract

In this paper, we present sufficient conditions, under which the stationary probability vector of a QBD process with both infinite levels and phases decays geometrically, characterized by the convergence norm η and the 1/η-left-invariant vector x of the rate matrix R. We also present a method to compute η and x based on spectral properties of the censored matrix of a matrix function constructed with the repeating blocks of the transition matrix of the QBD process. What makes this method attractive is its simplicity; finding η reduces to determining the zeros of a polynomial. We demonstrate the application of our method through a few interesting examples.     

Reducing component estimation for varying coefficient models

The estimation problem for varying coefficient models has been studied by many authors. We consider the problem in the case that the unknown functions admit different degrees of smoothness. In this paper we propose a reducing component local polynomial method to estimate the unknown functions. It is shown that all of our estimators achieve the optimal convergence rates. The asymptotic distributions of our estimators are also derived. The established asymptotic results and the simulation results show that our estimators outperform the the existing two-step estimators when the coefficient functions admit different degrees of smoothness. We also develop methods to speed up the estimation of the model and the selection of the bandwidths.     

Non-ergodic martingale estimating functions and related asymptotics

Well-known estimation methods such as conditional least squares, quasilikelihood and maximum likelihood (ML) can be unified via a single framework of martingale estimating functions (MEFs). Asymptotic distributions of estimates for ergodic processes use constant norm (e.g. square root of the sample size) for asymptotic normality. For certain non-ergodic-type applications, however, such as explosive autoregression and super-critical branching processes, one needs a random norm in order to get normal limit distributions. In this paper, we are concerned with non-ergodic processes and investigate limit distributions for a broad class of MEFs. Asymptotic optimality (within a certain class of non-ergodic MEFs) of the ML estimate is deduced via establishing a convolution theorem using a random norm. Applications to non-ergodic autoregressive processes, generalized autoregressive conditional heteroscedastic-type processes, and super-critical branching processes are discussed. Asymptotic optimality in terms of the maximum random limiting power regarding large sample tests is briefly discussed.     

Complete convergence for arrays of rowwise negatively superadditive-dependent random variables and its applications

In this paper, the Rosenthal-type maximal inequalities and Kolmogorov-type exponential inequality for negatively superadditive-dependent (NSD) random variables are presented. By using these inequalities, we study the complete convergence for arrays of rowwise NSD random variables. As applications, the Baum–Katz-type result for arrays of rowwise NSD random variables and the complete consistency for the estimator of nonparametric regression model based on NSD errors are obtained. Our results extend and improve the corresponding ones of Chen et al. [On complete convergence for arrays of rowwise negatively associated random variables. Theory Probab Appl. 2007;52(2):393–397] for arrays of rowwise negatively associated random variables to the case of arrays of rowwise NSD random variables.     

Asymptotic results for random coefficient bifurcating autoregressive processes

The purpose of this paper is to study the asymptotic behaviour of the weighted least-squares estimators of the unknown parameters of random coefficient bifurcating autoregressive processes. Under suitable assumptions on the immigration and the inheritance, we establish the almost sure convergence of our estimators, as well as a quadratic strong law and central limit theorems. Our study mostly relies on limit theorems for vector-valued martingales.