On the non-Markovian structure of discrete order statistics

In this note we show that the Markov Property holds for order statistics while sampling from a discrete parent population if and only if the population has at most two distinct units. This disproves the claim of Gupta and Gupta (1981) that for geometric parent, the order statistics form a Markov chain.     

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.     

On characterizations based on record values and order statistics

Consider an infinite sequence of independent random variables having common continuous c.d.f. F. For 1 ⩽ i ⩽ n, let X_i:n denote the ith order statistic of the first n random variables, and let {X(n), n ⩾ 1} be the sequence of upper record values. We examine the similarities and differences between the dependence structures of the X_i:n's and the X(n)'s, with an emphasis on the latter. We present an interesting situation involving a characterization of F using the moment sequence of records. We obtain characterizations based on the properties of certain regression functions associated with order statistics, record values, and the original observations. We discuss the resemblance between some known and some new characterizations based on order statistics, record values and those based on the properties of truncated F.     

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.     

Some aspects of the theory of estimating equations

An estimating equation for a parameter θ, based on an observation ?, is an equation g(x,θ)=0 which can be solved for θ in terms of x. An estimating equation is unbiased if the funaction g has 0 mean for every θ. For the case when the form of the frequency function p(x,θ) is completely specified up to the unknown real parameter θ, the optimality of the m.1 equation $\text{?}\text{log}\text{p}\text{?θ}\text{=0}$ in the class of all unbiased estimating equations was established by Godambe (1960). In this paper we allow the form of the frequency function p to vary assuming that $\text{x=(x}{}_1\text{,…,x}{}_{\mathrm{n}}\text{)?}\text{R}{}^{\mathrm{n}}$ and that under p, E(x_i)=θ. x₁,…, x_n are independent observations on a variate x, it is shown that among all the unbiased estimating equations for θ, $\text{x}\text{?}\text{?θ=0}$ is uniquely optimum up to a constant multiple.     

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.     

Limiting distributions of Kolmogorov-Lévy-type statistics under the alternative

Let X_i, 1 ≤ i ≤ n, be independent identically distributed random variables with a common distribution function F, and let G be a smooth distribution function. We derive the limit distribution of □{ρ_α(F_n, G) - _α(F, G)}, where F_n is the empirical distribution function based on X₁,…,X_n and _α is a Kolmogorov-Lévy-type metric between distribution functions. For α ≤ 0 and two distribution functions F and G the metric p_α is given by p_α(F, G) = inf {? ≤ 0: G(x - α?) - ? F(x) ≤ G(x + α?) + ? for all x ?}.     

Two remarks on order statistics

Let X₍₁₎,…,X_(n) be the order statistics of n iid distributed random variables. We prove that (X_(i)) have a certain Markov property for general distributions and secondly that the order statistics have monotone conditional regression dependence. Both properties are well known in the case of continuous distributions.     

Inequalities for generalized order statistics from some restricted family of distributions

The Steffensen inequality is applied to derive quantile bounds for the expectations of generalized order statistics from a distribution belonging to a particular subclass of distributions. The subclass consists of F having the property that F^?1(0+)=x₀>0 and that x →[1? F(x)]x^z is nonincreasing for all x > X₀ and some z > 0.     

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     

A characterization of the geometric distribution

We show that for a simple random sample from a discrete distribution on the positive integers, the regression ofX _(2∶n) onX _(1∶n) is linear with unit slope if and only if the distribution is geometric.     

On the Exponential Decay Rate of the Tail of a Discrete Probability Distribution

Abstract

We give a sufficient condition for the exponential decay of the tail of a discrete probability distribution π = (π _n ) _n≥0 in the sense that lim _n→∞(1/n) log∑ _i>n π _i  = ?θ with 0 < θ < ∞. We focus on analytic properties of the probability generating function of a discrete probability distribution, especially, the radius of convergence and the number of poles on the circle of convergence. Furthermore, we give an example of an M/G/1 type Markov chain such that the tail of its stationary distribution does not decay exponentially.     

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 useful property of order statistics and its application to UMVU estimation

Consider a random sample of sizen drawn from a continuous parent distributionF. A basic and useful known property associated with such sample is the following: the conditional distribution of thej ^th order statistic given a valuet of thei ^th order statistics, (j>i), coincides with the distribution of the(j?i) ^th order statistic in a sample of size (n?i) drawn from the parent distributionF truncated at the left att. In this article we mention some applications of this property, and provide a new application to the construction of an Uniformly Minimum Variance Unbiased (UMVU) estimator in the case of two-truncation parameters family of distributions.     

Lois limites pour les statistiques d'ordre dans le cas non identiquement distribue

Let X₁, X₂,… be a sequence of independent random variables with distribution functions F₁, where 1 ≤ i ≤ n, and for each n ≥ 1 let X_1,n ≤… ≤ X_n,n denote the order statistics of the first n random variables. Under suitable hypotheses about the F₁, we characterize the limit distribution functions H(x) for which P(X_k,n ? a_nx + b_n) → H(x), where a_n > 0 and b_n are real constants. We consider the cases where κ = κ(n) satisfies √n {κ(n)/n — λ} → 0 and √n {κ(n)/n — λ} → ∞ separately.     

New estimators of distribution functions

ABSTRACT

This article considers the estimation of a distribution function F_X(x) based on a random sample X₁, X₂, …, X_n when the sample is suspected to come from a close-by distribution F₀(x). The new estimators, namely the preliminary test (PTE) and Stein-type estimator (SE) are defined and compared with the “empirical distribution function” (edf) under local departure. In this case, we show that Stein-type estimators are superior to edf and PTE is superior to edf when it is close to F₀(x). As a by-product similar estimators are proposed for population quantiles.     

Tests of symmetry based on transformed empirical processes

A probability distribution function F is said to be symmetric when 1 ‐ F(x) ‐ F(‐x) = 0 for all x∈ R. Given a sequence of alternatives contiguous to a certain symmetric F₀, the authors are concerned with testing for the null hypothesis of symmetry. The proposed tests are consistent against any nonsymmetric alternative, and their power with respect to the given sequence can easily be optimized. The tests are constructed by means of transformed empirical processes with an adequate selection of the underlying isometry, and the optimum power is obtained by suitably choosing the score functions. The test statistics are very easy to compute and their asymptotic distributions are simple.     

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.