Testing Fiscal Sustainability via Strong Convergence of Gaussian Random Variables

We prove, via the Borel-Cantelli lemma, that for every sequence of Gaussian random variables the combination of convergence in expectation and decreasing variances at fractional-polynomial rate implies strong convergence. This result has an important consequence for macroeconomic stochastic infinite-horizon models: The almost sure transversality condition (i.e., fiscal sustainability with probability one) is satisfied if (a) the discounted levels of net liabilities are Gaussian-distributed with fractional-polynomially decaying variances and (b) their means converge to zero. If (a) holds but (b) fails, the transversality condition will be almost surely violated. Hence, (a) and (b) constitute a test for almost sure fiscal sustainability.     

Adjusted Supremum Score‐Type Statistics for Evaluating Non‐Standard Hypotheses

Supremum score test statistics are often used to evaluate hypotheses with unidentifiable nuisance parameters under the null hypothesis. Although these statistics provide an attractive framework to address non‐identifiability under the null hypothesis, little attention has been paid to their distributional properties in small to moderate sample size settings. In situations where there are identifiable nuisance parameters under the null hypothesis, these statistics may behave erratically in realistic samples as a result of a non‐negligible bias induced by substituting these nuisance parameters by their estimates under the null hypothesis. In this paper, we propose an adjustment to the supremum score statistics by subtracting the expected bias from the score processes and show that this adjustment does not alter the limiting null distribution of the supremum score statistics. Using a simple example from the class of zero‐inflated regression models for count data, we show empirically and theoretically that the adjusted tests are superior in terms of size and power. The practical utility of this methodology is illustrated using count data in HIV research.     

The almost sure convergence rate of the estimator of optimized certainty equivalent risk measure under α-mixing sequences

Conditional value-at-risk (CVaR) model is a kind of financial risk measure that is extensively supported and accepted by international financial community. Its optimized form can be regarded as an optimized certainty equivalent (OCE) risk measurement. In this paper, we mainly discuss and analyze the strong laws of large numbers and the convergence rate of OCE's estimator under α-mixing sequences. The result shows that the almost sure convergence rate of CVaR estimator is given by the results of OCE estimator. Its convergence rate is inversely proportional to the square root of the sample size under certain conditions. Its effectiveness is verified by simulation experiments for two classical α-mixing sequences.     

Is a Brownian Motion Skew?

We study the asymptotic behaviour of the maximum likelihood estimator corresponding to the observation of a trajectory of a skew Brownian motion, through a uniform time discretization. We characterize the speed of convergence and the limiting distribution when the step size goes to zero, which in this case are non‐classical, under the null hypothesis of the skew Brownian motion being an usual Brownian motion. This allows to design a test on the skewness parameter. We show that numerical simulations can be easily performed to estimate the skewness parameter and provide an application in Biology.     

Multiple change-point estimation with U-statistics

We consider a multiple change-point problem: a finite sequence of independent random variables consists of segments given by a known number of the so-called change-points such that the underlying distribution differs from segment to segment. The task is to estimate these change-points under no further assumptions on the within-segment distributions. In this completely nonparametric framework the proposed estimator is defined as the maximizing point of weighted multivariate U-statistic processes. Under mild moment conditions we prove almost sure convergence and the rate of convergence.     

Inference of Seasonal Long‐memory Time Series with Measurement Error

We consider the Whittle likelihood estimation of seasonal autoregressive fractionally integrated moving‐average models in the presence of an additional measurement error and show that the spectral maximum Whittle likelihood estimator is asymptotically normal. We illustrate by simulation that ignoring measurement errors may result in incorrect inference. Hence, it is pertinent to test for the presence of measurement errors, which we do by developing a likelihood ratio (LR) test within the framework of Whittle likelihood. We derive the non‐standard asymptotic null distribution of this LR test and the limiting distribution of LR test under a sequence of local alternatives. Because in practice, we do not know the order of the seasonal autoregressive fractionally integrated moving‐average model, we consider three modifications of the LR test that takes model uncertainty into account. We study the finite sample properties of the size and the power of the LR test and its modifications. The efficacy of the proposed approach is illustrated by a real‐life example.     

Asymptotics of M-estimator in multivariate linear regression models for a class of random errors

It is known that linear regression models have immense applications in various areas such as engineering technology, economics and social sciences. In this paper, we investigate the asymptotic properties of M-estimator in multivariate linear regression model based on a class of random errors satisfying a generalised Bernstein-type inequality. By using the generalised Bernstein-type inequality, we obtain a general result on almost sure convergence for a class of random variables and then obtain the strong consistency for the M-estimator in multivariate linear regression models under some mild conditions. The result extends or improves some existing ones in the literature. Moreover, we also consider the case when the dimension $p$ tends to infinity by establishing the rate of almost sure convergence for a class of random variables satisfying generalised Bernstein-type inequality. Some numerical simulations are also provided to verify the validity of the theoretical results.     

Consistency of the recursive nonparametric regression estimation for dependent functional data

We consider the recursive estimation of a regression functional where the explanatory variables take values in some functional space. We prove the almost sure convergence of such estimates for dependent functional data. Also we derive the mean quadratic error of the considered class of estimators. Our results are established with rates and asymptotic appear bounds, under strong mixing condition. Finally, the feasibility of the proposed estimator is illustrated throughout an empirical study.     

On asymptotic normality of likelihood and conditional analysis

The likelihood function from a large sample is commonly assumed to be approximately a normal density function. The literature supports, under mild conditions, an approximate normal shape about the maximum; but typically a stronger result is needed: that the normalized likelihood itself is approximately a normal density. In a transformation-parameter context, we consider the likelihood normalized relative to right-invariant measure, and in the location case under moderate conditions show that the standardized version converges almost surely to the standard normal. Also in a transformation-parameter context, we show that almost sure convergence of the normalized and standardized likelihood to a standard normal implies that the standardized distribution for conditional inference converges almost surely to a corresponding standard normal. This latter result is of immediate use for a range of estimating, testing, and confidence procedures on a conditional-inference basis.     

On almost sure convergence for sums of stochastic sequence

In this work we discuss almost sure convergence for sums of arbitrarily dependent stochastic sequence under different conditions of Chung’s type. Our approach is based on the stopping time technique and the theorem of convergence for martingale difference sequence. Meanwhile, the results here include some relevant classical conclusions.     

A Semiparametric Regression Model for Longitudinal Data with Non‐stationary Errors

Motivated by the need to analyze the National Longitudinal Surveys data, we propose a new semiparametric longitudinal mean‐covariance model in which the effects on dependent variable of some explanatory variables are linear and others are non‐linear, while the within‐subject correlations are modelled by a non‐stationary autoregressive error structure. We develop an estimation machinery based on least squares technique by approximating non‐parametric functions via B‐spline expansions and establish the asymptotic normality of parametric estimators as well as the rate of convergence for the non‐parametric estimators. We further advocate a new model selection strategy in the varying‐coefficient model framework, for distinguishing whether a component is significant and subsequently whether it is linear or non‐linear. Besides, the proposed method can also be employed for identifying the true order of lagged terms consistently. Monte Carlo studies are conducted to examine the finite sample performance of our approach, and an application of real data is also illustrated.     

Non‐Parametric Change‐Point Tests for Long‐Range Dependent Data

Abstract. We propose a non‐parametric change‐point test for long‐range dependent data, which is based on the Wilcoxon two‐sample test. We derive the asymptotic distribution of the test statistic under the null hypothesis that no change occurred. In a simulation study, we compare the power of our test with the power of a test which is based on differences of means. The results of the simulation study show that in the case of Gaussian data, our test has only slightly smaller power minus.3pt than the ‘difference‐of‐means’ test. For heavy‐tailed data, our test outperforms the ‘difference‐of‐means’ test.     

Strong Consistency of Reduced K‐means Clustering

Reduced k‐means clustering is a method for clustering objects in a low‐dimensional subspace. The advantage of this method is that both clustering of objects and low‐dimensional subspace reflecting the cluster structure are simultaneously obtained. In this paper, the relationship between conventional k‐means clustering and reduced k‐means clustering is discussed. Conditions ensuring almost sure convergence of the estimator of reduced k‐means clustering as unboundedly increasing sample size have been presented. The results for a more general model considering conventional k‐means clustering and reduced k‐means clustering are provided in this paper. Moreover, a consistent selection of the numbers of clusters and dimensions is described.     

A win ratio approach to comparing continuous non‐normal outcomes in clinical trials

Clinical trials are often designed to compare continuous non‐normal outcomes. The conventional statistical method for such a comparison is a non‐parametric Mann–Whitney test, which provides a P‐value for testing the hypothesis that the distributions of both treatment groups are identical, but does not provide a simple and straightforward estimate of treatment effect. For that, Hodges and Lehmann proposed estimating the shift parameter between two populations and its confidence interval (CI). However, such a shift parameter does not have a straightforward interpretation, and its CI contains zero in some cases when Mann–Whitney test produces a significant result. To overcome the aforementioned problems, we introduce the use of the win ratio for analysing such data. Patients in the new and control treatment are formed into all possible pairs. For each pair, the new treatment patient is labelled a ‘winner’ or a ‘loser’ if it is known who had the more favourable outcome. The win ratio is the total number of winners divided by the total numbers of losers. A 95% CI for the win ratio can be obtained using the bootstrap method. Statistical properties of the win ratio statistic are investigated using two real trial data sets and six simulation studies. Results show that the win ratio method has about the same power as the Mann–Whitney method. We recommend the use of the win ratio method for estimating the treatment effect (and CI) and the Mann–Whitney method for calculating the P‐value for comparing continuous non‐Normal outcomes when the amount of tied pairs is small. Copyright © 2016 John Wiley & Sons, Ltd.     

EXPONENTIAL SMOOTHING AND NON‐NEGATIVE DATA

The most common forecasting methods in business are based on exponential smoothing, and the most common time series in business are inherently non‐negative. Therefore it is of interest to consider the properties of the potential stochastic models underlying exponential smoothing when applied to non‐negative data. We explore exponential smoothing state space models for non‐negative data under various assumptions about the innovations, or error, process. We first demonstrate that prediction distributions from some commonly used state space models may have an infinite variance beyond a certain forecasting horizon. For multiplicative error models that do not have this flaw, we show that sample paths will converge almost surely to zero even when the error distribution is non‐Gaussian. We propose a new model with similar properties to exponential smoothing, but which does not have these problems, and we develop some distributional properties for our new model. We then explore the implications of our results for inference, and compare the short‐term forecasting performance of the various models using data on the weekly sales of over 300 items of costume jewelry. The main findings of the research are that the Gaussian approximation is adequate for estimation and one‐step‐ahead forecasting. However, as the forecasting horizon increases, the approximate prediction intervals become increasingly problematic. When the model is to be used for simulation purposes, a suitably specified scheme must be employed.     

On the almost sure convergence for sums of negatively superadditive dependent random vectors in Hilbert spaces and its application

Abstract

This paper develops almost sure convergence for sums of negatively superadditive dependent random vectors in Hilbert spaces, we obtain Chung type SLLN and the Jaite type SLLN for sequences of negatively superadditive dependent random vectors in Hilbert spaces. Rate of convergence is studied through considering almost sure convergence to 0 of tail series. As an application, the almost sure convergence of degenerate von Mises-statistics is investigated.     

Strong laws for associated random variables

We study the almost sure convergence and rates of weighted sums of associated random variables under the classical assumption of existence of Laplace transforms. This assumption implies the existence of every moment, so we address the same problem assuming a suitable decrease rate on tail joint probabilities which only implies the existence of finitely many moments, proving the analogous characterizations of convergence and rates. Still relaxing further the assumptions on moment existence, we also prove a Marcinkiewicz–Zygmund for associated variables without means, complementing existing results for this dependence structure.     

Almost sure convergence for weighted sums of WNOD random variables and its applications to non parametric regression models

In this article, some results on almost sure convergence for weighted sums of widely negative orthant dependent (WNOD) random variables are presented. The results obtained in the article generalize and improve the corresponding one of J. Lita Da Silva. [(2015), “Almost sure convergence for weighted sums of extended negatively dependent random variables.” Acta Math. Hungar. 146 (1), 56–70]. As applications, the strong convergence for the estimator of non parametric regression model are established.     

An oracle property of the Nadaraya–Watson kernel estimator for high‐dimensional nonparametric regression

The Nadaraya–Watson estimator is among the most studied nonparametric regression methods. A classical result is that its convergence rate depends on the number of covariates and deteriorates quickly as the dimension grows. This underscores the “curse of dimensionality” and has limited its use in high‐dimensional settings. In this paper, however, we show that the Nadaraya–Watson estimator has an oracle property such that when the true regression function is single‐ or multi‐index, it discovers the low‐rank dependence structure between the response and the covariates, mitigating the curse of dimensionality. Specifically, we prove that, using K‐fold cross‐validation and a positive‐semidefinite bandwidth matrix, the Nadaraya–Watson estimator has a convergence rate that depends on the number of indices rather than on the number of covariates. This result follows by allowing the bandwidths to diverge to infinity rather than restricting them all to converge to zero at certain rates, as in previous theoretical studies.