Central Limit Theorems for Reduced U‐Statistics Under Dependence and Their Usefulness

A reduced ‐statistic is a ‐statistic with its summands drawn from a restricted but balanced set of pairs. In this article, central limit theorems are derived for reduced ‐statistics under ‐mixing, which significantly extends the work of Brown & Kildea in various aspects. It will be shown and illustrated that reduced ‐statistics are quite useful in deriving test statistics in various nonparametric testing problems.     

Measuring the Discrepancy of a Parametric Model via Local Polynomial Smoothing

Abstract. In the context of multivariate mean regression, we propose a new method to measure and estimate the inadequacy of a given parametric model. The measure is basically the missed fraction of variation after adjusting the best possible parametric model from a given family. The proposed approach is based on the minimum L ² ‐distance between the true but unknown regression curve and a given model. The estimation method is based on local polynomial averaging of residuals with a polynomial degree that increases with the dimension d of the covariate. For any d ≥ 1 and under some weak assumptions we give a Bahadur‐type representation of the estimator from which ‐consistency and asymptotic normality are derived for strongly mixing variables. We report the outcomes of a simulation study that aims at checking the finite sample properties of these techniques. We present the analysis of a dataset on ultrasonic calibration for illustration.     

Histogram estimation of radon-nikodym derivatives for strong mixing data

Nonparametric inference for point processes is discussed by way of histograms, which provide a nice tool for the analysis of on-line data. The construction of histograms depends on a sequence of partitions, which we take tc be nonenibedded to allow partitions with sets of equal measure. This presents some theoretical problems, which are addressed with an assumption on the decomposition of second order moments. In another direction, we drop the usual independence assumption on the sample, replacing it by a strong mixing assumption. Under this setting, we study the convergence of the histogram in probability, which depends on approximation conditions between the distributions of random pairs and the product of their marginal distributions, and^almost completely, which is based on the decomposition of the second order moments. This last convergence is stated on two versions according to the assumption of Laplace transforms or the Cramer moment conditions. These are somewhat stronger, but enable us to recover the usual condition on the decrease rate of sets on each partition. In the final section we prove that the finite dimensional distributions converge in distribution to a Gaussian centered vector with a specified covariance.     

Concerning several methods for estimating crop acreages using remote sensing data

The objective of this paper is to present a comprehensive survey of the proportion estimation methods so far found in the literature and a newly proposed method based on the concept of statistically equivalent blocks. All methods are restricted to the case of normal mixtures only. Graphical and semigraphical techniques are excluded. Several proportion estimation methods have been described and their properties discussed.     

Weak approximations for quantile processes of stationary sequences

ABSTRACT By studying the deviations between uniform empirical and quantile processes (the so-called Bahadur-Kiefer representations) of a stationary sequence in properly weighted sup-norm metrics, we find a general approach to obtaining weighted results for uniform quantile processes of stationary sequences. Consequently we are able to obtain weak convergence for weighted uniform quantile processes of stationary mixing and associated sequences. Further, by studying the sup-norm distance of a general quantile process from its corresponding uniform quantile process, we find that information at the two end points of the uniform quantile process can be so utilized that this weighted sup-norm distance converges in probability to zero under the so-called Csörgõ-Révész conditions. This enables us to obtain weak convergence for weighted general quantile processes of stationary mixing and associated sequences.     

Mixing of MCMC algorithms

We analyse MCMC chains focusing on how to find simulation parameters that give good mixing for discrete time, Harris ergodic Markov chains on a general state space X having invariant distribution π. The analysis uses an upper bound for the variance of the probability estimate. For each simulation parameter set, the bound is estimated from an MCMC chain using recurrence intervals. Recurrence intervals are a generalization of recurrence periods for discrete Markov chains. It is easy to compare the mixing properties for different simulation parameters. The paper gives general advice on how to improve the mixing of the MCMC chains and a new methodology for how to find an optimal acceptance rate for the Metropolis-Hastings algorithm. Several examples, both toy examples and large complex ones, illustrate how to apply the methodology in practice. We find that the optimal acceptance rate is smaller than the general recommendation in the literature in some of these examples.     

The Pearson Diffusions: A Class of Statistically Tractable Diffusion Processes

Abstract.  The Pearson diffusions form a flexible class of diffusions defined by having linear drift and quadratic squared diffusion coefficient. It is demonstrated that for this class explicit statistical inference is feasible. A complete model classification is presented for the ergodic Pearson diffusions. The class of stationary distributions equals the full Pearson system of distributions. Well-known instances are the Ornstein–Uhlenbeck processes and the square root (CIR) processes. Also diffusions with heavy-tailed and skew marginals are included. Explicit formulae for the conditional moments and the polynomial eigenfunctions are derived. Explicit optimal martingale estimating functions are found. The discussion covers GMM, quasi-likelihood, non-linear weighted least squares estimation and likelihood inference too. The analytical tractability is inherited by transformed Pearson diffusions, integrated Pearson diffusions, sums of Pearson diffusions and Pearson stochastic volatility models. For the non-Markov models, explicit optimal prediction-based estimating functions are found. The estimators are shown to be consistent and asymptotically normal.