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.     

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.     

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.     

An approach to evaluating sensitivity in Bayesian regression analyses

This paper presents a method for assessing the sensitivity of predictions in Bayesian regression analyses. In parametric Bayesian analyses there is a family s₀ of regression functions, parametrized by a finite-dimensional vector B. The family s₀ is a subset of R, the set of all possible regression functions. A prior π₀ on B induces a prior on R. This paper assesses sensitivity by computing bounds on the predictive probability of a fixed set K over a class of priors, Γ, induced by a class of families of regression functions, Γ_s, and a class of priors, Γ_π. This paper is divided into three parts which (1) define Γ, (2) describe an algorithm for finding accurate bounds on predictive probabilities over Γ and (3) illustrate the method with two examples. It is found that sensitivity to the family of regression functions can be much more important than sensitivity to π₀.     

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.     

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.     

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.     

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.     

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.     

Nonparametric estimation of the lower tail dependence λL in bivariate copulas

The lower tail dependence λ_L is a measure that characterizes the tendency of extreme co-movements in the lower tails of a bivariate distribution. It is invariant with respect to strictly increasing transformations of the marginal distribution and is therefore a function of the copula of the bivariate distribution. λ_L plays an important role in modelling aggregate financial risk with copulas. This paper introduces three non-parametric estimators for λ_L. They are weakly consistent under mild regularity conditions on the copula and under the assumption that the number k = k(n) of observations in the lower tail, used for estimation, is asymptotically k ≈ √n. The finite sample properties of the estimators are investigated using a Monte Carlo simulation in special cases. It turns out that these estimators are biased, where amount and sign of the bias depend on the underlying copula, on the sample size n, on k, and on the true value of λ_L.     

Law of iterated logarithm and almost sure limit points for random sums

Let {X_n,n≥1} be a sequence of independent identically distributed (i.i.d) random variables with a common distribution function F. When F belongs to the domain of partial attraction of a Semi-Stable law with index ,0<<2, we give complete solution to the results of R. Vasudeva and G. Divanji [Law of iterated logarithm for random subsequences, Statist. Probab. Lett. 12 (1991) 189–194], where they obtained Chover’s form of the law of iterated logarithm for random subsequences. Further, we extended the situation in obtaining almost sure limit points for random subsequences.     

The flower intersection problem for Kirkman triple systems

The flower at a point x in a Steiner triple system is the set of all triples containing x. Denote by I_R^*[r] the set of all integers k such that there exists a pair of KTS(2r+1) having k+r triples in common, r of them being the triples of a common flower. In this article we determine the set I_R^*[r] for any positive integer r≡1 (mod 3) (only nine cases are left undecided for r=7,13,16,19), and establish that I_R^*[r]=J[r] for r≡1 (mod 3) and r22 where J[r]={0,1,…,2r(r−1)/3−6,2r(r−1)/3−4,2r(r−1)/3}.     

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.     

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.     

Balanced e-optimal designs of resolution III for the 2×3 series

We consider the problem of constructing designs which are E-optimal in the class of all balanced resolution III designs for the 2^m×3ⁿ series. The inverse of the information matrix for general resolution III balanced 2^m×3ⁿ designs is obtained. Optimal designs are constructed for the cases (m,n)=(3, 1), (4, 1), (2, 2) and (3, 2) for various numbers of runs in the practical range.     

Some new partial orderings on Sn and Sn×Sn

A new class of partial orderings on S_n, the set of permutations of {1,…,n}, is given. Each of these partial orderings is shown to be a subordering of a recently described partial ordering on S_n (Block, Chhetry, Fang and Sampson (1990)) which is related to Schriever's (1987) more associated ordering on bivariate distributions. Also given is an extension of three known partial orders on S_n to partial orders on S_n×S_n. These extensions facilitate the study of functions from S_n×S_n into , which preser these partial orderings, thereby, providing a methodology for extending the notion of arrangement increasing functions.     

A unified and elementary proof of serial and nonserial, univariate and multivariate, Chernoff–Savage results

We provide a simple proof that the Chernoff–Savage [H. Chernoff, I.R. Savage, Asymptotic normality and efficiency of certain nonparametric tests, Ann. Math. Statist. 29 (1958) 972–994] result, establishing the uniform dominance of normal-score rank procedures over their Gaussian competitors, also holds in a broad class of problems involving serial and/or multivariate observations. The non-admissibility of the corresponding everyday practice Gaussian procedures (multivariate least-squares estimators, multivariate t-tests and F-tests, correlogram-based methods, multivariate portmanteau and Durbin–Watson tests, etc.) follows. The proof, which generalizes to the multivariate—possibly serial—set-up the idea developed in J.L. Gastwirth, S.S. Wolff [An elementary method for obtaining lower bounds on the asymptotic power of rank tests, Ann. Math. Statist. 39 (1968) 2128–2130] in the context of univariate location problems, allows for avoiding technical convexity and variational arguments.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.