Testing equality of proportions with incomplete correlated data

Let (ψ_i,φ_i) be independent, identically distributed pairs of zero-one random variables with (possible) dependence of ψ_i and φ_i within the pair. For n pairs, both variables are observed, but for m₁ additional pairs only ψ_i is observed and for m₂ others φ_i is observed. If π_1· = P{ψ_i = 1} and π_·1=P{φ_i, the problem is to test π_1·=π_·1. Maximum likelihood estimates of π_1· and π_·1 are obtained via the EM algorithm. A test statistic is developed whose null distribution is asymptotically chi-square with one degree of freedom (as n and either m₁ or m₂ tend to infinity). If m₁ = m₂ = 0 the statistic reduces to that of McNemar's test; if n = 0, it is equivalent to the statistic for testing equality of two independent proportions. This test is compared with other tests by means of Pitman efficiency. Examples are presented.     

Linearity of regression for non-adjacent record values

Let X₁,X₂,… be a sequence of iid random variables having a continuous distribution; by R₁,R₂,… denote the corresponding record values. All the distributions allowing linearity of regressions either E(R_m+k|R_m) or E(R_m|R_m+k) are identified.     

Adaptive wavelet empirical Bayes estimation of a location or a scale parameter

Assume that in independent two-dimensional random vectors (X₁,θ₁),…,(X_n,θ_n), each θ_i is distributed according to some unknown prior density function g. Also, given θ_i=θ, X_i has the conditional density function q(x−θ), x,θ(−∞,∞) (a location parameter case), or θ⁻¹q(x/θ), x,θ(0,∞) (a scale parameter case). In each pair the first component is observable, but the second is not. After the (n+1)th pair (X_n+1,θ_n+1) is obtained, the objective is to construct an empirical Bayes (EB) estimator of θ. In this paper we derive the EB estimators of θ based on a wavelet approximation with Meyer-type wavelets. We show that these estimators provide adaptation not only in the case when g belongs to the Sobolev space H with an unknown , but also when g is supersmooth.     

A Remark on the Zhang Omnibus Test for Normality

Zhang (1999) proposed a novel test statistic Q for testing normality based on the ratio of two unbiased standard deviation estimators, q₁ and q₂, for the true population standard deviation σ. Mingoti & Neves (2003) discussed some properties of q₁ and q₂ and showed that the variance of q₁ increases as the true population variance increases. In this paper, we show that the distribution of q₁ is not normal. As a result, normality percentage points for Q are not appropriate. In this paper, percentage points of Q are obtained using simulations. Monte Carlo simulations are provided to evaluate the performance of the new method and Zhang's method.     

On the non-existence of generalised Hadamard matrices

The determinant of a generalized Hadamard matrix over its group ring factored out by the relation Σ_gεG G = 0 is shown to have certain number theoretic properties. These are exploited to prove the non-existence of many generalised Hadamard matrices for groups whose orders are divisible by 3, 5 or 7. For example the GH(15, C₁₅), GH(15, C₃) and GH(15, C₅) do not exist. Also for certain n and G we find the set of determinants of the GH(n, G) matrices.     

Asymptotic normality of a weighted integrated squared error of kernel regression estimates with data-dependent bandwidth

Let (X, Y) be a bivariate random vector and let be the regression function of Y on X that has to be estimated from a sample of i.i.d. random vectors (X₁, Y₁),…,(X_n, Y_n) having the same distribution as (X, Y). In the present paper it is shown that the normalized integrated squared error of a kernel estimator with data-driven bandwidth is asymptotically normally distributed.     

Likelihood ratio ordering of order statistics

This paper provides an improvement on the work of Bapat and Kochar (1994, Linear Algebra Appl., 199, 281–291) and strengthens the literature on the likelihood ratio ordering of order statistics. For independent (but possibly nonidentically distributed) absolutely continuous random variables X₁,…,X_n, it is shown under some weak conditions that

X_1:n^lrlrX_n:n,

where ^lr stands for the likelihood ratio ordering and X_k:n represents the kth-order statistic.     

A critical look at Lo's modified R/S statistic

We report on an empirical investigation of the modified rescaled adjusted range or R/S statistic that was proposed by Lo, 1991. Econometrica 59, 1279–1313, as a test for long-range dependence with good robustness properties under ‘extra’ short-range dependence. In contrast to the classical R/S statistic that uses the standard deviation S to normalize the rescaled range R, Lo's modified R/S-statistic V_q is normalized by a modified standard deviation S_q which takes into account the covariances of the first q lags, so as to discount the influence of the short-range dependence structure that might be present in the data. Depending on the value of the resulting test-statistic V_q, the null hypothesis of no long-range dependence is either rejected or accepted. By performing Monte-Carlo simulations with ‘truly’ long-range- and short-range dependent time series, we study the behavior of V_q, as a function of q, and uncover a number of serious drawbacks to using Lo's method in practice. For example, we show that as the truncation lag q increases, the test statistic V_q has a strong bias toward accepting the null hypothesis (i.e., no long-range dependence), even in ideal situations of ‘purely’ long-range dependent data.     

Optimal on-line detection of outside observations

Suppose that a Markov process X₁,X₂,… appears consecutively. There are two random moments of time θ₁ and θ₂, independent of (X_n). The distribution of the process (X_n) changes for the first time at instant θ₁ and for the second time at instant θ₂. Our objective is to find a stopping rule based only upon the former values of (X_n) which maximizes the probability that the moment of stopping is between θ₁ and θ₂. A sufficient condition is given under which an optimal stopping time is finite. The maximal probability corresponding to the optimal rule is found.     

Concentration functions and Bayesian robustness

The concentration function, extending the classical notion of Lorenz curve, is well suited for comparing probability measures. Such a feature can be useful in different issues in Bayesian robustness, when a probability measure is deemed a baseline to be compared with other measures by means of their functional forms. Neighbourhood classes Γ of probability measures, including well-known ones, can be defined through the concentration function and both prior and posterior expectations of given functions of the unknown parameter are studied. The ranges of such expectations over Γ can be found, restricting the search among the extremal measures in Γ. The concentration function can be also used as a criterion to assess posterior robustness, when considering sensitivity to changes in the likelihood and the prior.     

On Berry-Esseen theorem for some functions of U-statistics

The rate of convergence in the central limit theorem and in the random central limit theorem for some functions of U-statistics are established. The theorems refer to the asymptotic behaviour of the sequence {g(U_n),n≥1}, where g belongs to the class of all differentiable functions g such that g′εL(δ) and U_n is a U-statistics.     

A Bayesian criterion for selecting super saturated screening designs

Super-saturated designs in which the number of factors under investigation exceeds the number of experimental runs have been suggested for screening experiments initiated to identify important factors for future study. Most of the designs suggested in the literature are based on natural but ad hoc criteria. The “average s²” criteria introduced by Booth and Cox (Technometrics 4 (1962) 489) is a popular choice. Here, a decision theoretic approach is pursued leading to an optimality criterion based on misclassification probabilities in a Bayesian model. In certain cases, designs optimal under the average s² criterion are also optimal for the new criterion. Necessary conditions for this to occur are presented. In addition, the new criterion often provides a strict preference between designs tied under the average s² criterion, which is advantageous in numerical search as it reduces the number of local minima.     

Predicting integrals of diffusion processes

Consider predicting the integral of a diffusion process Z in a bounded interval A, based on the observations Z(t_1n),…,Z(t_nn), where t_1n,…,t_nn is a dense triangular array of points (the step of discretization tends to zero as n increases) in the bounded interval. The best linear predictor is generally not asymptotically optimal. Instead, we predict using the conditional expectation of the integral of the diffusion process, the optimal predictor in terms of minimizing the mean squared error, given the observed values of the process. We obtain that, conditioning on the observed values, the order of convergence in probability to zero of the mean squared prediction error is O_p(n⁻²). We prove that the standardized conditional prediction error is approximately Gaussian with mean zero and unit variance, even though the underlying diffusion is generally non-Gaussian. Because the optimal predictor is hard to calculate exactly for most diffusions, we present an easily computed approximation that is asymptotically optimal. This approximation is a function of the diffusion coefficient.     

Bounds on posterior expectations for density bounded class with constant bandwidth

We consider a certain (simplified) version of the density bounded class; see Lavine (J. Amer. Statist. Assoc. 86 (1991) 400–403). We find that this class has certain advantages over many other similar classes in terms of elicitation, ease of calculation and other characteristics of interest. Bounds on posterior expectations are considered. In particular, we show how certain bounds may be found in the (multidimensional) normal linear model problem.     

Bayesian estimation for first-order autoregressive model with explanatory variables

In this article, we develop a Bayesian analysis in autoregressive model with explanatory variables. When σ² is known, we consider a normal prior and give the Bayesian estimator for the regression coefficients of the model. For the case σ² is unknown, another Bayesian estimator is given for all unknown parameters under a conjugate prior. Bayesian model selection problem is also being considered under the double-exponential priors. By the convergence of ρ-mixing sequence, the consistency and asymptotic normality of the Bayesian estimators of the regression coefficients are proved. Simulation results indicate that our Bayesian estimators are not strongly dependent on the priors, and are robust.     

Reference priors for exponential families

Reference analysis, introduced by Bernardo (J. Roy. Statist. Soc. 41 (1979) 113) and further developed by Berger and Bernardo (On the development of reference priors (with discussion). In: J.M. Bernardo, J.O. Berger, A.P. Dawid, A.F.M. Smith (Eds.), Bayesian Statistics, Vol. 4, Clarendon Press, Oxford, pp. 35–60), has proved to be one of the most successful general methods to derive noninformative prior distributions. In practice, however, reference priors are typically difficult to obtain. In this paper we show how to find reference priors for a wide class of exponential family likelihoods.     

Bayesian ratemaking under Dirichlet process mixtures

Experience ratemaking plays a crucial role in general insurance in determining future premiums of individuals in a portfolio by assessing observed claims from the whole portfolio. This paper investigates this problem in which claims can be modeled by certain parametric family of distributions. The Dirichlet process mixtures are employed to model the distributions of the parameters so as to make two advantages: to produce exact Bayesian experience premiums for a class of premium principles generated from generic error functions and, at the same time, provide robust and flexible ways to avoid possible bias caused by traditionally used priors such as non informative priors or conjugate priors. In this paper, the Bayesian experience ratemaking under Dirichlet process mixture models are investigated and due to the lack of analytical forms of the conditional expectations of the quantities concerned, the Gibbs sampling schemes are designed for the purpose of approximations.     

Bayesian optimal sequential design for nonparametric regression via inhomogeneous evolutionary MCMC

We develop a novel computational methodology for Bayesian optimal sequential design for nonparametric regression. This computational methodology, that we call inhomogeneous evolutionary Markov chain Monte Carlo, combines ideas of simulated annealing, genetic or evolutionary algorithms, and Markov chain Monte Carlo. Our framework allows optimality criteria with general utility functions and general classes of priors for the underlying regression function. We illustrate the usefulness of our novel methodology with applications to experimental design for nonparametric function estimation using Gaussian process priors and free-knot cubic splines priors.     

Non parametric mixture priors based on an exponential random scheme

We propose a general procedure for constructing nonparametric priors for Bayesian inference. Under very general assumptions, the proposed prior selects absolutely continuous distribution functions, hence it can be useful with continuous data. We use the notion ofFeller-type approximation, with a random scheme based on the natural exponential family, in order to construct a large class of distribution functions. We show how one can assign a probability to such a class and discuss the main properties of the proposed prior, namedFeller prior. Feller priors are related to mixture models with unknown number of components or, more generally, to mixtures with unknown weight distribution. Two illustrations relative to the estimation of a density and of a mixing distribution are carried out with respect to well known data-set in order to evaluate the performance of our procedure. Computations are performed using a modified version of an MCMC algorithm which is briefly described.