L p –Estimators as Estimates of a Parameter of Location for a Sharp–pointed Symmetric Density

We study the asymptotics of L _p estimators, p > 0, over a sample having a symmetric density with a sharp–point at the centre of symmetry of the distribution. The rates of convergence of the L _p estimators in this situation depend on p and on the shape of the density. To obtain some of the limit distributions, we present new results in the asymptotics of M–estimators. We extend the delta method to the case when the Euclidean norm of the conveniently normalized M–estimators converge to a power of the Euclidean norm of a (possibly Gaussian) stable distribution.     

Testing for linearity in generalized linear models using kernel smoothing

A test statistic proposed by Li (1999) for testing the adequacy of heteroscedastic nonlinear regression models using nonparametric kernel smoothers is applied to testing for linearity in generalized linear models. Simulation results for models with centered gamma and inverse Gaussian errors are presented to illustrate the performance of the resulting test compared with log-likelihood ratio tests for specific parametric alternatives. The test is applied to a data set of coronary heart disease status (Hosmer and Lemeshow, (1990).     

Asymptotic approximations to the distribution of Kendall's sample τ

This paper provides a saddlepoint approximation to the distribution of the sample version of Kendall's τ, which is a measure of association between two samples. The saddlepoint approximation is compared with the Edgeworth and the normal approximations, and with the bootstrap resampling distribution. A numerical study shows that with small sample sizes the saddlepoint approximation outperforms both the normal and the Edgeworth approximations. This paper gives also an analytical comparison between approximated and exact cumulants of the sample Kendall's τ when the two samples are independent.     

The performance of alternative estimators for the probit model with first-order serial correlation 1

The purpose of the paper is to evaluate the relative performance of two generalized conditional moment (GCM) estimators in terms of their mean squared errors, for the Probit model with first-order serial correlation. The first estimator is a linearized one-step estimator described by Poirier and Ruud (1988). The second one is defined in the present paper. Monte Car10 experiments suggest that the GCM estimators outperform the ordinary Probit estimator. The two GCM estimators do almost equally well, except that the second one may be easier to calculate, especially in large samples.     

Bootstrapping estimators for the seemingly unrelated regressions model

In this paper we consider the possibility of using the bootstrap to estimate the finite sample variability of feasible generalized least squares and improved estimators applied to the seemingly unrelated regressions model. The improved estimators we employ include members of the Stein-rule family and a hierarchical Bayes estimator proposed by Blattberg and George (1991). Simulation experiments are carried out using several SUR examples as well as a very large example based on the price-promotion model, and data, from marketing research.     

Non-Gaussian Ornstein–Uhlenbeck-based models and some of their uses in financial economics

Non-Gaussian processes of Ornstein–Uhlenbeck (OU) type offer the possibility of capturing important distributional deviations from Gaussianity and for flexible modelling of dependence structures. This paper develops this potential, drawing on and extending powerful results from probability theory for applications in statistical analysis. Their power is illustrated by a sustained application of OU processes within the context of finance and econometrics. We construct continuous time stochastic volatility models for financial assets where the volatility processes are superpositions of positive OU processes, and we study these models in relation to financial data and theory.     

Simulation techniques for generalized Gaussian densities

This contribution deals with the Monte Carlo simulation of generalized Gaussian random variables. Such a parametric family of distributions has been proposed in many applications in science to describe physical phenomena and in engineering, and it seems to be also useful in modelling economic and financial data. For values of the shape parameter α within a certain range, the distribution presents heavy tails. In particular, the cases α=1/3 and α=1/2 are considered. For such values of the shape parameter, different simulation methods are assessed.     

Smooth tail-index estimation

The two parametric distribution functions appearing in the extreme-value theory – the generalized extreme-value distribution and the generalized Pareto distribution – have log-concave densities if the extreme-value index γ∈[?1, 0]. Replacing the order statistics in tail-index estimators by their corresponding quantiles from the distribution function that is based on the estimated log-concave density ? f _n leads to novel smooth quantile and tail-index estimators. These new estimators aim at estimating the tail index especially in small samples. Acting as a smoother of the empirical distribution function, the log-concave distribution function estimator reduces estimation variability to a much greater extent than it introduces bias. As a consequence, Monte Carlo simulations demonstrate that the smoothed version of the estimators are well superior to their non-smoothed counterparts, in terms of mean-squared error.     

An efficient and fast algorithm for estimating the frequencies of superimposed exponential signals in zero-mean multiplicative and additive noise

In this paper, we consider the superimposed exponential signals in zero-mean multiplicative and additive noise when all the noise are independently and identically distributed. We use a three-step iterative procedure to estimate the frequencies of the considered model. It is observed that the estimators are consistent and work quite well in terms of biases and mean square errors. Moreover, the convergence rate of the estimators attains O _p (N ^?3/2), which is the best convergence rate in the case of only additive noise and constant amplitude.     

A Hellinger distance approach to MCMC diagnostics

Bayesian analysis often requires the researcher to employ Markov Chain Monte Carlo (MCMC) techniques to draw samples from a posterior distribution which in turn is used to make inferences. Currently, several approaches to determine convergence of the chain as well as sensitivities of the resulting inferences have been developed. This work develops a Hellinger distance approach to MCMC diagnostics. An approximation to the Hellinger distance between two distributions f and g based on sampling is introduced. This approximation is studied via simulation to determine the accuracy. A criterion for using this Hellinger distance for determining chain convergence is proposed as well as a criterion for sensitivity studies. These criteria are illustrated using a dataset concerning the Anguilla australis, an eel native to New Zealand.