On An Intriguing Distributional Identity

For a continuous random variable X with support equal to (a, b), with c.d.f. F, and g: Ω₁ → Ω₂ a continuous, strictly increasing function, such that Ω₁∩Ω₂?(a, b), but otherwise arbitrary, we establish that the random variables F(X) ? F(g(X)) and F(g^{? 1}(X)) ? F(X) have the same distribution. Further developments, accompanied by illustrations and observations, address as well the equidistribution identity U ? ψ(U) = ^dψ^{? 1}(U) ? U for U ～ U(0, 1), where ψ is a continuous, strictly increasing and onto function, but otherwise arbitrary. Finally, we expand on applications with connections to variance reduction techniques, the discrepancy between distributions, and a risk identity in predictive density estimation.     

Rate of consistency of one sample tests of location

Let X₁,…,X_n be a sample from a population with continuous distribution function F(x?θ) such that F(x)+F(-x)=1 and 0<F(x)<1, x?R¹. It is shown that the power- function of a monotone test of H: θ=θ₀ against K: θ>θ₀ cannot tend to 1 as θ?θ₀ → ∞ more than n times faster than the tails of F tend to 0. Some standard as well as robust tests are considered with respect to this rate of convergence.     

On tail parameter estimation in certain point process models

Let μ(ds, dx) denote Poisson random measure with intensity dsG(dx) on (0, ∞) × (0, ∞), for a measure G(dx) with tails varying regularly at ∞. We deal with estimation of index of regular variation α and weight parameter ξ if the point process is observed in certain windows K_n = [0, T_n] × [Y_n, ∞), where Y_n → ∞ as n → ∞. In particular, we look at asymptotic behaviour of the Hill estimator for α. In certain submodels, better estimators are available; they converge at higher speed and have a strong optimality property. This is deduced from the parametric case G(dx) = ξαx^−α−1 dx via a neighbourhood argument in terms of Hellinger distances.     

Minimax regression designs for approximately linear models with autocorrelated errors

We study the construction of regression designs, when the random errors are autocorrelated. Our model of dependence assumes that the spectral density g(ω) of the error process is of the form g(ω) = (1 − α)g₀(ω) + αg₁(ω), where g₀(ω) is uniform (corresponding to uncorrelated errors), α ϵ [0, 1) is fixed, and g₁(ω) is arbitrary. We consider regression responses which are exactly, or only approximately, linear in the parameters. Our main results are that a design which is asymptotically (minimax) optimal for uncorrelated errors retains its optimality under autocorrelation if the design points are a random sample, or a random permutation, of points from this distribution. Our results are then a partial extension of those of Wu (Ann. Statist. 9 (1981), 1168–1177), on the robustness of randomized experimental designs, to the field of regression design.     

A unified approach to characterization problems using conditional expectations

In recent years characterization problems have become of increasing interest. It is well known that mean residual life e(x) = E(X - x|X ⩾x) and right-censored mean function m_R(x) = E(X | X ⩽ x), uniquely determine the distribution function F(x) = P(X ⩽ x). In this paper, we study characterizations problems for general distributions, using the doubly censored mean function m(x, y) = E(X | x⩽X⩽y). We show that m(x, y) characterizes F(x), obtaining the explicit expression of F(x) from m(x, y). Moreover, we give properties that any function must verifies to be a doubly censored mean function and we obtain stability theorems for these characterizations.     

Nonparametric Benchmark Dose Estimation with Continuous Dose‐Response Data

We propose a new method for risk‐analytic benchmark dose (BMD) estimation in a dose‐response setting when the responses are measured on a continuous scale. For each dose level d, the observation X(d) is assumed to follow a normal distribution: . No specific parametric form is imposed upon the mean μ(d), however. Instead, nonparametric maximum likelihood estimates of μ(d) and σ are obtained under a monotonicity constraint on μ(d). For purposes of quantitative risk assessment, a ‘hybrid’ form of risk function is defined for any dose d as R(d) = P[X(d) < c], where c > 0 is a constant independent of d. The BMD is then determined by inverting the additional risk functionR_A(d) = R(d) ? R(0) at some specified value of benchmark response. Asymptotic theory for the point estimators is derived, and a finite‐sample study is conducted, using both real and simulated data. When a large number of doses are available, we propose an adaptive grouping method for estimating the BMD, which is shown to have optimal mean integrated squared error under appropriate designs.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

The number of solutions to the alternate matrix equation over a finite field and a q-identity

Let F_q be a finite field with q elements, where q is a power of a prime. In this paper, we first correct a counting error for the formula N(K_2ν,0^(m)) occurring in Carlitz (1954. Arch. Math. V, 19–31). Next, using the geometry of symplectic group over F_q, we have given the numbers of solutions X of rank k and solutions X to equation XAX′=B over F_q, where A and B are alternate matrices of order n, rank 2ν and order m, rank 2s, respectively. Finally, an elementary q-identity is obtained from N(K_2ν,0⁽⁰⁾), and the explicit results for N(K_n,2ν,K_m,2s) is represented by terminating q-hypergeometric series.     

Algorithms for the construction of optimizing distributions

We will consider the following problem.Maximise Φ(p)over P={p=(p₁,P₂,…,p_j):P_j≧0,∑p_j=1}". We require to calcute an optimizing distribution. Examples arise in optimal regression design,maximum likelihood estimation and stratified sazmpling problems. A class of multiplicative algorithms, indexed by functions which depend on the derivatives of Φ(·)is considered for solving this problem.Iterations are of the form:p_j ^(r+1)αp_j ^(r)f(x_j ^(r)), where x_{j (r)}=d_j ^(r) or F_j ^(r)and d_j ^(r)=?Φ/?p_j While F_j ^(r)=D_j ^(r)?∑p_i ^(r)d_i ^(r) (a directional derivative)at p=p^(r)f(·)satisfies some suitable properties and may depend on one or more free parameters. These iterations neatly submit to the constraints ofv the problem. Some results will be reported and extensions to problems dependin on two or more distributions and to problems with additional constraints will be considered.     

On the construction of orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set

Complete sets of orthogonal F-squares of order n = s^p, where g is a prime or prime power and p is a positive integer have been constructed by Hedayat, Raghavarao, and Seiden (1975). Federer (1977) has constructed complete sets of orthogonal F-squares of order n = 4t, where t is a positive integer. We give a general procedure for constructing orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set, where n is not necessarily a prime or prime power. In particular, we show how to construct sets of orthogonal F-squares of order n = 2s^p, where s is a prime or prime power and p is a positive integer. These sets are shown to be near complete and approach complete sets as s and/or p become large. We have also shown how to construct orthogonal arrays by these methods. In addition, the best upper bound on the number t of orthogonal F(n, λ₁), F(n, λ₂), …, F(n, λ₁) squares is given.     

A remark on estimating the mean of a normal distribution with known coefficient of variation

Let X₁, X₂, …, X_n be iid N(μ, aμ²) (a>0) random variables with an unknown mean μ>0 and known coefficient of variation (CV) √a. The estimation of μ is revisited and it is shown that a modified version of an unbiased estimator of μ [cf. Khan RA. A note on estimating the mean of a normal distribution with known CV. J Am Stat Assoc. 1968;63:1039–1041] is more efficient. A certain linear minimum mean square estimator of Gleser and Healy [Estimating the mean of a normal distribution with known CV. J Am Stat Assoc. 1976;71:977–981] is also modified and improved. These improved estimators are being compared with the maximum likelihood estimator under squared-error loss function. Based on asymptotic consideration, a large sample confidence interval is also mentioned.     

Fitting a multiple regression function

Consider the p-dimensional unit cube [0,1]^p, p≥1. Partition [0, 1]^p into n regions, R_1,n,…,R_n,n such that the volume Δ(R_j,n) is of order n^?1,j=1,…,n. Select and fix a point in each of these regions so that we have x⁽ⁿ⁾₁,…,x⁽ⁿ⁾_n. Suppose that associated with the j-th predictor vector x⁽ⁿ⁾_j there is an observable variable Y⁽ⁿ⁾_j, j=1,…,n, satisfying the multiple regression model $\text{Y}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{=g(}\text{x}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{)+e}{}^{\mathrm{(n)}}{}_{\mathrm{j}}$, where g is an unknown function defined on [0, 1]^pand {e⁽ⁿ⁾_j} are independent identically distributed random variables with Ee⁽ⁿ⁾₁=0 and Var e⁽ⁿ⁾₁=σ²<∞. This paper proposes as an estimator of g(x), where k(u) is a known p-dimensional bounded density and {a_n} is a sequence of reals converging to 0 asn→∞. Weak and strong consistency of g_n(x) and rates of convergence are obtained. Asymptoticnormality of the estimator is established. Also proposed is $\text{σ}{}^2{}_{\mathrm{n}}\text{=n}{}^{\mathrm{?1}}\text{Σ}{}^{\mathrm{n}}{}_{\mathrm{j=1}}\text{(Y}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{?g}{}_{\mathrm{n}}\text{(}\text{x}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{))}{}^2$ as a consistent estimate of σ².     

Regression analysis using order statistics

In this article, we study the joint distribution of X and two linear combinations of order statistics, a ^T Y ₍₂₎ and b ^T Y ₍₂₎, where a = (a ₁, a ₂) ^T and b = (b ₁, b ₂) ^T are arbitrary vectors in R ² and Y ₍₂₎ = (Y ₍₁₎, Y ₍₂₎) ^T is a vector of ordered statistics obtained from (Y ₁, Y ₂) ^T when (X, Y ₁, Y ₂) ^T follows a trivariate normal distribution with a positive definite covariance matrix. We show that this distribution belongs to the skew-normal family and hence our work is a generalization of Olkin and Viana (J Am Stat Assoc 90:1373–1379, 1995) and Loperfido (Test 17:370–380, 2008).     

A formula for P(bi≤Ri≤ai, 1≤i≤m) under a general class of alternatives

Let X_i≤?≤X_m and Y_i≤?≤Y_n be two sets of independent order statistics from continous distributions with distribution functions F and G respectively. Let R_i denote the rank of X_i in the combined order sample. Steck (1980) has found an expression for P(b_i≤R_i≤a_i, all i) when F = h(G), h being the incomplete beta function with parameters (α,β?α+1). An alternative expression for the same probability is obtained which is computationally a substantial improvement on Steck's result.     

Kolmogorov-type tests of goodness-of-fit against stochastic ordering

This article addresses the problem of testing the null hypothesis H₀ that a random sample of size n is from a distribution with the completely specified continuous cumulative distribution function F_n(x). Kolmogorov-type tests for H₀ are based on the statistics C⁺ _n = Sup[F_n(x)?F₀(x)] and C^? _n=Sup[F₀(x)?F_n(x)], where F_n(x) is an empirical distribution function. Let F(x) be the true cumulative distribution function, and consider the ordered alternative H₁: F(x)≥F₀(x) for all x and with strict inequality for some x. Although it is natural to reject H₀ and accept H₁ if C ⁺ _n is large, this article shows that a test that is superior in some ways rejects F₀ and accepts H₁ if C^mdash _n is small. Properties of the two tests are compared based on theoretical results and simulated results.     

Robustness of locally most powerful invariant test for normal mixture model in control and treatment populations

Two independent samples from control with N(μ₁, σ²) and treatment with pN(μ₁, σ²) + (1 − p)N(μ₂, σ²) are considered. A locally most powerful invariant test for testing H₀: μ₁ = μ₂ against H₁ : μ₂ > μ₁, where σ² > 0, 0 < p < 1 are unknown, is obtained. Also, the robustness of the test statistic on the lines of Kariya and Sinha (Robustness of Statistical Tests (1989). Academic Press, New York) is studied.     

Finite mixtures of natural exponential families

Let μ be a positive measure concentrated on R⁺ generating a natural exponential family (NEF) F with quadratic variance function V_F(m), m being the mean parameter of F. It is shown that v(dx) = (γ+x)μ(γ ≥ 0) (γ ≥ 0) generates a NEF G whose variance function is of the form l(m)Δ+cΔ(m), where l(m) is an affine function of m, Δ(m) is a polynomial in m (the mean of G) of degree 2, and c is a constant. The family G turns out to be a finite mixture of F and its length-biased family. We also examine the cases when F has cubic variance function and show that for suitable choices of γ the family G has variance function of the form P(m) + Q(m)m where P, Q are polynomials in m of degree m2 while Δ is an affine function of m. Finally we extend the idea to two dimensions by considering a bivariate Poisson and bivariate gamma mixture distribution.     

Confidence Intervals for Nonparametric Regression Functions with Missing Data

Suppose that we have a nonparametric regression model Y = m(X) + ε with X ∈ R^p, where X is a random design variable and is observed completely, and Y is the response variable and some Y-values are missing at random. Based on the “complete” data sets for Y after nonaprametric regression imputation and inverse probability weighted imputation, two estimators of the regression function m(x₀) for fixed x₀ ∈ R^p are proposed. Asymptotic normality of two estimators is established, which is used to construct normal approximation-based confidence intervals for m(x₀). We also construct an empirical likelihood (EL) statistic for m(x₀) with limiting distribution of χ²₁, which is used to construct an EL confidence interval for m(x₀).     

Limiting behavior of randomly weighted averages of symmetric heavy-tailed random variables

In this paper we consider a sequence of independent continuous symmetric random variables X₁, X₂, …, with heavy-tailed distributions. Then we focus on limiting behavior of randomly weighted averages S_n = R⁽ⁿ⁾₁X₁ + ??? + R⁽ⁿ⁾_nX_n, where the random weights R⁽ⁿ⁾₁, …, R_n⁽ⁿ⁾ which are independent of X₁, X₂, …, X_n, are the cuts of (0, 1) by the n ? 1 order statistics from a uniform distribution. Indeed we prove that c_nS_n converges in distribution to a symmetric α-stable random variable with c_n = n^{1 ? 1/α}/Γ^1/α(α + 1).