Noninformative priors for the normal variance ratio

In this paper, we consider noninformative priors for the ratio of variances in two normal populations. We develop first and second order matching priors. We find that the second order matching prior matches alternative coverage probabilities up to the second order and is also a HPD matching prior. It turns out that among the reference priors, only one-at-a-time reference prior satisfies a second order matching criterion. Our simulation study indicates that the one-at-a-time reference prior performs better than other reference priors in terms of matching the target coverage probabilities in a frequentist sense. This work is supported by Korea Research Foundation Grant (KRF-2004-002-C00041).     

A Bayesian approach to non-parametric monotone function estimation

Summary.  The paper proposes two Bayesian approaches to non-parametric monotone function estimation. The first approach uses a hierarchical Bayes framework and a characterization of smooth monotone functions given by Ramsay that allows unconstrained estimation. The second approach uses a Bayesian regression spline model of Smith and Kohn with a mixture distribution of constrained normal distributions as the prior for the regression coefficients to ensure the monotonicity of the resulting function estimate. The small sample properties of the two function estimators across a range of functions are provided via simulation and compared with existing methods. Asymptotic results are also given that show that Bayesian methods provide consistent function estimators for a large class of smooth functions. An example is provided involving economic demand functions that illustrates the application of the constrained regression spline estimator in the context of a multiple-regression model where two functions are constrained to be monotone.     

Assessing robustness of crossover designsto subjects dropping out

In some crossover experiments, particularly in medical applications, subjects may fail to complete their sequences of treatments for reasons unconnected with the treatments received. A method is described of assessing the robustness of a planned crossover design, with more than two periods, to subjects leaving the study prematurely. The method involves computing measures of efficiency for every possible design that can result, and is therefore very computationally intensive. Summaries of these measures are used to choose between competing designs. The computational problem is reduced to a manageable size by a software implementation of Polya theory. The method is applied to comparing designs for crossover studies involving four treatments and four periods. Designs are identified that are more robust to subjects dropping out in the final period than those currently favoured in medical and clinical trials.     

A note on modelling underreported Poisson counts

In this paper we present a parsimonious model for the analysis of underreported Poisson count data. In contrast to previously developed methods, we are able to derive analytic expressions for the key marginal posterior distributions that are of interest. The usefulness of this model is explored via a re-examination of previously analysed data covering the purchasing of port wine (Ramos, 1999).     

Asymptotic Analysis of the Sieve Estimator for a Class of Parabolic SPDEs

In this paper we consider the problem of estimating a coefficient of a strongly elliptic partial differential operator in stochastic parabolic equations. The coefficient is a bounded function of time. We compute the maximum likelihood estimate of the function on an approximating space (sieve) using a finite number of the spatial Fourier coefficients of the solution and establish conditions that guarantee consistency and asymptotic normality of the resulting estimate as the number of the coefficients increases. The equation is assumed diagonalizable in the sense that all the operators have a common system of eigenfunctions.     

Optimal scaling of Metropolis algorithms: Heading toward general target distributions

The authors provide an overview of optimal scaling results for the Metropolis algorithm with Gaussian proposal distribution. They address in more depth the case of high‐dimensional target distributions formed of independent, but not identically distributed components. They attempt to give an intuitive explanation as to why the well‐known optimal acceptance rate of 0.234 is not always suitable. They show how to find the asymptotically optimal acceptance rate when needed, and they explain why it is sometimes necessary to turn to inhomogeneous proposal distributions. Their results are illustrated with a simple example.     

Characterizations based on Rényi entropy of order statistics and record values

Two different distributions may have equal Rényi entropy; thus a distribution cannot be identified by its Rényi entropy. In this paper, we explore properties of the Rényi entropy of order statistics. Several characterizations are established based on the Rényi entropy of order statistics and record values. These include characterizations of a distribution on the basis of the differences between Rényi entropies of sequences of order statistics and the parent distribution.     

A mixture model for random graphs

The Erdös–Rényi model of a network is simple and possesses many explicit expressions for average and asymptotic properties, but it does not fit well to real-world networks. The vertices of those networks are often structured in unknown classes (functionally related proteins or social communities) with different connectivity properties. The stochastic block structures model was proposed for this purpose in the context of social sciences, using a Bayesian approach. We consider the same model in a frequentest statistical framework. We give the degree distribution and the clustering coefficient associated with this model, a variational method to estimate its parameters and a model selection criterion to select the number of classes. This estimation procedure allows us to deal with large networks containing thousands of vertices. The method is used to uncover the modular structure of a network of enzymatic reactions.     

Bayesian inference and model comparison for asymmetric smooth transition heteroskedastic models

Inference, quantile forecasting and model comparison for an asymmetric double smooth transition heteroskedastic model is investigated. A Bayesian framework in employed and an adaptive Markov chain Monte Carlo scheme is designed. A mixture prior is proposed that alleviates the usual identifiability problem as the speed of transition parameter tends to zero, and an informative prior for this parameter is suggested, that allows for reliable inference and a proper posterior, despite the non-integrability of the likelihood function. A formal Bayesian posterior model comparison procedure is employed to compare the proposed model with its two limiting cases: the double threshold GARCH and symmetric ARX GARCH models. The proposed methods are illustrated using both simulated and international stock market return series. Some illustrations of the advantages of an adaptive sampling scheme for these models are also provided. Finally, Bayesian forecasting methods are employed in a Value-at-Risk study of the international return series. The results generally favour the proposed smooth transition model and highlight explosive and smooth nonlinear behaviour in financial markets.