The strong uniform convergence of multivariate variable kernel estimates

We show that sup, completely as, where f is a uniformly continuous density on are independent random vectors with common density f, and f_n is the variable kernel estimate Here H_ni is the distance between X_i and its kth nearest neighbour, K is a given density satisfying some regularity conditions, and k is a sequence of integers with the property that log asn     

Non-parametric recursive estimates of a probability density function and its derivatives

Recursive estimates of a probability density function (pdf) are known. This paper presents recursive estimates of a derivative of any desired order of a pdf. Let f be a pdf on the real line and p?0 be any desired integer. Based on a random sample of size n from f, estimators f^(p)_n of f^(p), the pth order derivatives of f, are exhibited. These estimators are of the form $\text{n}{}^{\mathrm{?1}}\text{∑n}\text{j=1}\text{δ}{}_{\mathrm{jp}}$, where δ_jp depends only on p and the jth observation in the sample, and hence can be computed recursively as the sample size increases. These estimators are shown to be asymptotically unbiased, mean square consistent and strongly consistent, both at a point and uniformly on the real line. For pointwise properties, the conditions on f^(p) have been weakened with a little stronger assumption on the kernel function.     

On the convergence of some adaptive estimation procedures

In the paper we consider some adaptive procedures for estimating the unknown parameters of autoregressive and moving average processes. In case of AK(p) and MA(1) processes sequences of estimators converging with probability one and In mean square are given     

On improving convergence rate of Bernstein polynomial density estimator

This paper is concerned with the Bernstein estimator [Vitale, R.A. (1975), ‘A Bernstein Polynomial Approach to Density Function Estimation’, in Statistical Inference and Related Topics, ed. M.L. Puri, 2, New York: Academic Press, pp. 87–99] to estimate a density with support [0, 1]. One of the major contributions of this paper is an application of a multiplicative bias correction [Terrell, G.R., and Scott, D.W. (1980), ‘On Improving Convergence Rates for Nonnegative Kernel Density Estimators’, The Annals of Statistics, 8, 1160–1163], which was originally developed for the standard kernel estimator. Moreover, the renormalised multiplicative bias corrected Bernstein estimator is studied rigorously. The mean squared error (MSE) in the interior and mean integrated squared error of the resulting bias corrected Bernstein estimators as well as the additive bias corrected Bernstein estimator [Leblanc, A. (2010), ‘A Bias-reduced Approach to Density Estimation Using Bernstein Polynomials’, Journal of Nonparametric Statistics, 22, 459–475] are shown to be O(n^?8/9) when the underlying density has a fourth-order derivative, where n is the sample size. The condition under which the MSE near the boundary is O(n^?8/9) is also discussed. Finally, numerical studies based on both simulated and real data sets are presented.     

The stochastic approximation method for the estimation of a multivariate probability density

We apply the stochastic approximation method to construct a large class of recursive kernel estimators of a probability density, including the one introduced by Hall and Patil [1994. On the efficiency of on-line density estimators. IEEE Trans. Inform. Theory 40, 1504–1512]. We study the properties of these estimators and compare them with Rosenblatt's nonrecursive estimator. It turns out that, for pointwise estimation, it is preferable to use the nonrecursive Rosenblatt's kernel estimator rather than any recursive estimator. A contrario, for estimation by confidence intervals, it is better to use a recursive estimator rather than Rosenblatt's estimator.     

Estimating the probability of obtaining nonfeasible parameter estimates of the generalized pareto distribution

In this paper we consider the problem of estimating the parameters of the generalized Pareto distribution. Both the method of moments and probability-weighted moments do not guarantee that their respective estimates will be consistent with the observed data. We present simple programs to predict the probability of obtaining such nonfeasible estimates. Our estimation techniques are based on results from intensive simulations and the successful modelling of the lower tail of the distribution of the upper bound of the support. More simulations are performed to validate the new procedure.     

Recursive estimation of the mode of a multivariate density

Let f be an unknown possibly multimodal density on R^d and let X₁, X₂, … be a sequence of independent random vectors with density f. Several recursive estimates of the mode of f are proposed, and sufficient conditions ensuring their weak and strong consistency are established.     

On the weak convergence of kernel density estimators in Lp spaces

Since its introduction, the pointwise asymptotic properties of the kernel estimator f?_n of a probability density function f on ?^d, as well as the asymptotic behaviour of its integrated errors, have been studied in great detail. Its weak convergence in functional spaces, however, is a more difficult problem. In this paper, we show that if f_n(x)=(f?_n(x)) and (r_n) is any nonrandom sequence of positive real numbers such that r_n/√n→0 then if r_n(f?_n?f_n) converges to a Borel measurable weak limit in a weighted L^p space on ?^d, with 1≤p<∞, the limit must be 0. We also provide simple conditions for proving or disproving the existence of this Borel measurable weak limit.     

On the convergence rate of model selection criteria

The goal of the current paper is to compare consistent and inconsistent model selection criteria by looking at their convergence rates (to be defined in the first section). The prototypes of the two types of criteria are the AIC and BIC criterion respectively. For linear regression models with normally distributed errors, we show that the convergence rates for AIC and BIC are 0(n^-1) and 0((n log n)^-1/2) respectively. When the error distributions are unknown, the two criteria become indistinguishable, all having convergence rate O(n^-1/2). We also argue that the BIC criterion has nearly optimal convergence rate. The results partially justified some of the controversial simulation results in which inconsistent criteria seem to outperform consistent ones.     

On the probability distribution of economic growth

Three important and significantly heteroscedastic gross domestic product series are studied. Omnipresent heteroscedasticity is removed and the distributions of the series are then compared to normal, normal mixture and normal–asymmetric Laplace (NAL) distributions. NAL represents a skewed and leptokurtic distribution, which is in line with the Aghion and Howitt [1 Aghion, P. and Howitt, P. 1992. A model of growth through creative destruction. Econometrica, 60: 323–351. [Crossref], [Web of Science ®] [Google Scholar]] model for economic growth, based on Schumpeter's idea of creative destruction. Statistical properties of the NAL distributions are provided and it is shown that NAL fits the data better than the alternatives.     

On the Estimation of Integrated Covariance Functions of Stationary Random Fields

Abstract.  For stationary vector-valued random fields on     the asymptotic covariance matrix for estimators of the mean vector can be given by integrated covariance functions. To construct asymptotic confidence intervals and significance tests for the mean vector, non-parametric estimators of these integrated covariance functions are required. Integrability conditions are derived under which the estimators of the covariance matrix are mean-square consistent. For random fields induced by stationary Boolean models with convex grains, these conditions are expressed by sufficient assumptions on the grain distribution. Performance issues are discussed by means of numerical examples for Gaussian random fields and the intrinsic volume densities of planar Boolean models with uniformly bounded grains.     

On the mean square convergence of the convolution representation of linear filters

Mean square convergence is the most frequently considered mode of convergence for the infinite series convolution expressions representing filter outputs in stationary time series analysis. There is confusion, however, also in the literature, about which conditions guarantee that this convergence holds. If only general properties of the input series to the filter are known, it is appropriate to consider the class of series with these properties. For each of several classes of full rank, wide sense stationary, zero-mean, vector time series, a weakest possible condition on the frequency response function of a linear filter is given which guarantees that the time-domain convolution representation of the filter converges to the filter output in mean square, whenever the input series belongs to the class under consideration. The classes considered are (i) the purely nondeterministic series with essentially bounded spectral density matrix, (ii) all purely nondeterministic series, (iii) all series. We then show that more unified resttlts can be obtained if Cesiro sums are utilized to define the convergence of the convolution representation. The mean square convergence of infinite autoregressions is also discussed.     

On optimising the estimation of high quantiles of a probability distribution

One of the major aims of one-dimensional extreme-value theory is to estimate quantiles outside the sample or at the boundary of the sample. The underlying idea of any method to do this is to estimate a quantile well inside the sample but near the boundary and then to shift it somehow to the right place. The choice of this “anchor quantile” plays a major role in the accuracy of the method. We present a bootstrap method to achieve the optimal choice of sample fraction in the estimation of either high quantile or endpoint estimation which extends earlier results by Hall and Weissman (1997) in the case of high quantile estimation. We give detailed results for the estimators used by Dekkers et al. (1989). An alternative way of attacking problems like this one is given in a paper by Drees and Kaufmann (1998).     

The rate of convergence to stationarity for M/G/1 models with admission controls via coupling

We study the workload processes of two M/G/1 queueing systems with restricted capacity: in Model 1 any service requirement that would exceed a certain capacity threshold is truncated; in Model 2 new arrivals do not enter the system if they have to wait more than a fixed threshold time in line. For Model 1 we obtain several results concerning the rate of convergence to equilibrium. In particular, we derive uniform bounds for geometric ergodicity with respect to certain subclasses. For Model 2 geometric ergodicity follows from the finiteness of the moment-generating function of the service time distribution. We derive bounds for the convergence rates in special cases. The proofs use the coupling method.     

On the asymptotic independence of numbers of observations near order statistics

In this paper, we consider the numbers of observations in two-sided neighbourhoods of the kth and (n?r)th order statistics from a sample of size n and show that they are asymptotically independent as n→∞. We also establish a result that generalizes all the existing results regarding the asymptotic independence of numbers of observations in the left and right neighbourhoods of order statistics. Finally, we consider the limiting joint behaviour of numbers of observations in the neighbourhoods of s central order statistics and establish that they are asymptotically independent.