On the number of near-records after the maximum observation in a continuous sample

{X_n, n≥1} are independent and identically distributed random variables with continuous distribution function F(x). For j=1,…,n, X_j is called a near-record up to time n if X_j ∈ (M_na, M_n], where M_n = max_1≤j≤n {X_j} and a is a positive constant. Let Z_n(a) denote the number of near-records after, and including the maximum observation of the sequence. In this paper, the distributional results of Z_n(a) are considered and its asymptotic behaviours are studied.     

Simulation of weibull and gamma autoregressive stationary process

This paper presents two simple non-Gaussian first-order autoregressive markovian processes which are easy to simulate via a computer. The autoregressive Gamma process {X_n:} is constructed according to the stochastic difference equation X_n:=V_n:X_n?1+?_n:, where {?_n:} is an i.i.d. Exponential sequence and {V_n:} is i.i.d. with Power-function distribution defined on the interval [0,1). The autoregressive Weibull process {X_n:} is constructed from the probabilistic model X_n:= k.min (X_n?1:, Y_n:) where {Y_n:} is an i.i.d. Weibull sequence and k > 1.     

Sequential Estimation of Expectations in the Presence of Trend2

A sequence of independent random variables {Z_n:n≥ 1} with unknown probability distributions is considered and the problem of estimating their expectations {M_n+1: n≥ 1} is examined. The estimation of M_n+1 is based on a finite set {z_k:1≤k≤n}, each z_k being an observed value of Z_k, 1 ≤k≤n, and also based on the assumption that {M_n:n≥ 1} follows an unknown trend of a specified form.     

Variants of the graph dependent model in extreme value theory

With a set X₁, X₂, .... X_n n random variables, a graph is associated whose vertices are the integers 1,2,..., n and whose edges represent those pairs i and j for which the events {X_i>X} and {X_j>X} do not become “almost independent” for “large X”. With a variety of assumption on the edge set of the graph, the asymptotic distribution of the extremes of the X_j, when properly normalized, is determined. This refines the earlier result of the present author on this kind of dependence, and extends and unifies several known dependent extreme value models.     

Record values of exponentially distributed random variables

A sequence {X_n, n≥1} of independent and identically distributed random variables with absolutely continuous (with respect to Lebesque measure) cumulative distribution function F(x) is considered. X_j is a record value of this sequence if X_j>max(X₁,…,X_j?1), j>1. Let {X_L(n), n≥0} with L(o)=1 be the sequence of such record values and Z_n,n?1=X_L(n)–X_L(n?1). Some properties of Z_n,n?1 are studied and characterizations of the exponential distribution are discussed in terms of the expectation and the hazard rate of z_n,n?1.     

Optimized algorithms for computing Wilcoxon's T n,Wilcoxon's W m,n and Ansari-Bradley's A m,n statistics when m and n are small

Wilcoxon's signed rank sum test, Wilcoxon's rank sum test and the Ansari-Bradley rank test are three well-known distribution-free tests. When the sample size is large enough, the lower tail probabilities P 0 {T n /< = x} , P 0 {W m,n /< = x} and P 0 {A m,n /< = x} may be easily computed, under H 0 , using some normal approximations. When the size of the samples is too small, these normal approximations become insufficient. Therefore, the main goal of our work is to find some fast algorithms which compute the exact lower tail probabilities P 0 {T n /< = x}, P 0 {W m,n /< = x} and P 0 {A m,n /< = x} when the normal approximation is inefficient.     

Distributions of patterns of two successes separated by a string of <Emphasis Type="Italic">k</Emphasis>-2 failures

Let Z ₁, Z ₂, . . . be a sequence of independent Bernoulli trials with constant success and failure probabilities p = Pr(Z _t  = 1) and q = Pr(Z _t  = 0) = 1 − p, respectively, t = 1, 2, . . . . For any given integer k ≥ 2 we consider the patterns E₁{\mathcal{E}_{1}}: two successes are separated by at most k−2 failures, E₂{\mathcal{E}_{2}}: two successes are separated by exactly k −2 failures, and E₃{\mathcal{E}_{3}} : two successes are separated by at least k − 2 failures. Denote by N_n,k⁽ⁱ⁾{ N_{n,k}^{(i)}} (respectively M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}) the number of occurrences of the pattern E_i{\mathcal{E}_{i}} , i = 1, 2, 3, in Z ₁, Z ₂, . . . , Z _n when the non-overlapping (respectively overlapping) counting scheme for runs and patterns is employed. Also, let T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} (resp. W_r,k⁽ⁱ⁾){W_{r,k}^{(i)})} be the waiting time for the r − th occurrence of the pattern E_i{\mathcal{E}_{i}}, i = 1, 2, 3, in Z ₁, Z ₂, . . . according to the non-overlapping (resp. overlapping) counting scheme. In this article we conduct a systematic study of N_n,k⁽ⁱ⁾{N_{n,k}^{(i)}}, M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}, T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} and W_r,k⁽ⁱ⁾{W_{r,k}^{(i)}} (i = 1, 2, 3) obtaining exact formulae, explicit or recursive, for their probability generating functions, probability mass functions and moments. An application is given.     

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.     

Conditional estimation of average on the basis of weighting data

LetF(x,y) be a distribution function of a two dimensional random variable (X,Y). We assume that a distribution functionF _x(x) of the random variableX is known. The variableX will be called an auxiliary variable. Our purpose is estimation of the expected valuem=E(Y) on the basis of two-dimensional simple sample denoted by:U=[(X ₁, Y₁)…(X_n, Y_n)]=[X Y]. LetX=[X ₁…X _n]andY=[Y ₁…Y _n].This sample is drawn from a distribution determined by the functionF(x,y). LetX _(k)be the k-th (k=1, …,n) order statistic determined on the basis of the sampleX. The sampleU is truncated by means of this order statistic into two sub-samples: % MathType!End!2!1! and % MathType!End!2!1!.Let % MathType!End!2!1! and % MathType!End!2!1! be the sample means from the sub-samplesU _k,1 andU _k,2, respectively. The linear combination % MathType!End!2!1! of these means is the conditional estimator of the expected valuem. The coefficients of this linear combination depend on the distribution function of auxiliary variable in the pointx _(k).We can show that this statistic is conditionally as well as unconditionally unbiased estimator of the averagem. The variance of this estimator is derived. The variance of the statistic % MathType!End!2!1! is compared with the variance of the order sample mean. The generalization of the conditional estimation of the mean is considered, too.     

A zero-one law for large order statistics

Fix r ≥ 1, and let {M_nr} be the rth largest of {X₁,X₂,…X_n}, where X₁,X₂,… is a sequence of i.i.d. random variables with distribution function F. It is proved that P[M_nr ≤ u_n i.o.] = 0 or 1 according as the series Σ^∞_n=3Fⁿ(u_n)(log log n)^r/n converges or diverges, for any real sequence {u_n} such that n{1 -F(u_n)} is nondecreasing and divergent. This generalizes a result of Bamdorff-Nielsen (1961) in the case r = 1.     

A bound for the Euclidean distance between restricted and unrestricted estimators of parametric functions in the general linear model

Let [^(\varveck)]{\widehat{\varvec{\kappa}}} and [^(\varveck)]_r{\widehat{\varvec{\kappa}}_r} denote the best linear unbiased estimators of a given vector of parametric functions \varveck = \varvecKb{\varvec{\kappa} = \varvec{K\beta}} in the general linear models M = {\varvecy, \varvecX\varvecb, s²\varvecV}{{\mathcal M} = \{\varvec{y},\, \varvec{X\varvec{\beta}},\, \sigma^2\varvec{V}\}} and M_r = {\varvecy, \varvecX\varvecb | \varvecR \varvecb = \varvecr, s²\varvecV}{{\mathcal M}_r = \{\varvec{y},\, \varvec{X}\varvec{\beta} \mid \varvec{R} \varvec{\beta} = \varvec{r},\, \sigma^2\varvec{V}\}}, respectively. A bound for the Euclidean distance between [^(\varveck)]{\widehat{\varvec{\kappa}}} and [^(\varveck)]_r{\widehat{\varvec{\kappa}}_r} is expressed by the spectral distance between the dispersion matrices of the two estimators, and the difference between sums of squared errors evaluated in the model M{{\mathcal M}} and sub-restricted model M_r^*{{\mathcal M}_r^*} containing an essential part of the restrictions \varvecR\varvecb = \varvecr{\varvec{R}\varvec{\beta} = \varvec{r}} with respect to estimating \varveck{\varvec{\kappa}}.     

Quadratic subspaces and construction of Bayes invariant quadratic estimators of variance components in mixed linear models

Gnot et al. (J Statist Plann Inference 30(1):223–236, 1992) have presented the formulae for computing Bayes invariant quadratic estimators of variance components in normal mixed linear models of the form where the matrices V _i , 1 ≤ i ≤ k − 1, are symmetric and nonnegative definite and V _k is an identity matrix. These formulae involve a basis of a quadratic subspace containing MV ₁ M,...,MV _k-1 M,M, where M is an orthogonal projector on the null space of X′. In the paper we discuss methods of construction of such a basis. We survey Malley’s algorithms for finding the smallest quadratic subspace including a given set of symmetric matrices of the same order and propose some modifications of these algorithms. We also consider a class of matrices sharing some of the symmetries common to MV ₁ M,...,MV _k-1 M,M. We show that the matrices from this class constitute a quadratic subspace and describe its explicit basis, which can be directly used for computing Bayes invariant quadratic estimators of variance components. This basis can be also used for improving the efficiency of Malley’s algorithms when applied to finding a basis of the smallest quadratic subspace containing the matrices MV ₁ M,...,MV _k-1 M,M. Finally, we present the results of a numerical experiment which confirm the potential usefulness of the proposed methods. Dedicated to the memory of Professor Stanisław Gnot.     

On moments of the supremum of normed weighted averages

Let {X, X_n; n ≥ 1} be a sequence of real-valued iid random variables, 0 < r < 2 and p > 0. Let D = { A = (a_nk; 1 ≤ k ≤ n, n ≥ 1); a_nk, ? R and sup_{n, k} |a_n,k| < ∞}. Set S_n( A ) = ∑ⁿ_k=1a_{n, k}X_k for A ? D and n ≥ 1. This paper is devoted to determining conditions whereby E{sup_{n ≥ 1}, |S_n( A )|/n^1/r}^p < ∞ or E{sup_{n ≥ 2} |S_n( A )|/2n log n)^1/2}^p < ∞ for every A ? D. This generalizes some earlier results, including those of Burkholder (1962), Choi and Sung (1987), Davis (1971), Gut (1979), Klass (1974), Siegmund (1969) and Teicher (1971).     

Empirical bayes tests in a positive exponential family with partial information on priors

We investigate an empirical Bayes testing problem in a positive exponential family having pdf f{x/θ)=c(θ)u(x) exp(?x/θ), x>0, θ>0. It is assumed that θ is in some known compact interval [C₁, C₂]. The value C₁ is used in the construction of the proposed empirical Bayes test δ^* _n. The asymptotic optimality and rate of convergence of its associated Bayes risk is studied. It is shown that under the assumption that θ is in [C₁, C₂] δ^* _n is asymptotically optimal at a rate of convergence of order O(n^?1/n n). Also, δ^* _n is robust in the sense that δ^* _n still possesses the asymptotic optimality even the assumption that "C₁≦θ≦C₂ may not hold.     

Nonparametric Estimation of a Regression Function: Limiting Distribution2

Consider the regression model Y_i= g(x_i) + e_i, i = 1,…, n, where g is an unknown function defined on [0, 1], 0 = x₀ < x₁ < … < x_n≤ 1 are chosen so that max_1≤i≤n(x_i-x_{i- 1}) = 0(n^-1), and where {e_i} are i.i.d. with Ee₁= 0 and Var e₁ - s?². In a previous paper, Cheng & Lin (1979) study three estimators of g, namely, g_1n of Cheng & Lin (1979), g_2n of Clark (1977), and g_3n of Priestley & Chao (1972). Consistency results are established and rates of strong uniform convergence are obtained. In the current investigation the limiting distribution of &_in, i = 1, 2, 3, and that of the isotonic estimator g**_n are considered.     

Record values and the geometric distribution

Suppose {X_n, n≥1} is a sequence of independent and identically distributed discrete random variables having the common distribution function F(x). The exact distribution of the n-th record value is given under the assumption that F(x) has the geometric distribution. Various properties of the record values and some new characterizations of the geometric distribution are presented.     

A note on a strong renewal theorem

Let {S_n, n ≥ 1} be a sequence of partial sums of independent and identically distributed non-negative random variables with a common distribution function F. Let F belong to the domain of attraction of a stable law with exponent α, 0 < α < 1. Suppose H(t) = ? N(t), t ? 0, where N(t) = max(n : S_n ≥ t). Under some additional assumptions on F, the difference between H(t) and its asymptotic value as t → ∞ is estimated.     

Large deviation local limit theorems for ratio statistics

Let {T_n, n ≥ 1} be an arbitrary sequence of nonlattice random variables and let {S_n, n ≥ 1} be another sequence of positive random variables. Assume that the sequences are independent. In this paper we obtain asymptotic expression for the density function of the ratio statistic R_n = T_n/S_n based on simple conditions on the moment generating functions of T_n and S_n. When S_n = re, our main result reduces to that of Chaganty and Sethura-man[Ann. Probab. 13(1985):97-114]. We also obtain analogous results when T_n and S_n are both lattice random variables. We call our theorems large deviation local limit theorems for R_n, since the conditions of our theorems imply that R_n → c in probability for some constant c. We present some examples to illustrate our theorems.     

Optimum invariant tests for random manova models

Consider the canonical-form MANOVA setup with X: n × p = (+ E, X_i n_i × p, i = 1, 2, 3, M_i: n_i × p, i = 1, 2, n₁ + n₂ + n₃) p, where E is a normally distributed error matrix with mean zero and dispersion I_n (> 0 (positive definite). Assume (in contrast with the usual case) that M₁i is normal with mean zero and dispersion I_n1) and M₂2 is either fixed or random normal with mean zero and different dispersion matrix I_n2 (being unknown. It is also assumed that M₁ E, and M₂ (if random) are all independent. For testing H₀) = 0 versus H₁: (> 0, it is shown that when either n₂ = 0 or M₂ is fixed if n₂ > 0, the trace test of Pillai (1955) is uniformly most powerful invariant (UMPI) if min(n₁, p)= 1 and locally best invariant (LBI) if min(n₁ p) > 1 underthe action of the full linear group Gl (p). When p > 1, the LBI test is also derived under a somewhat smaller group G_T(p) of p × p lower triangular matrices with positive diagonal elements. However, such results do not hold if n₂ > 0 and M₂ is random. The null, nonnull, and optimality robustness of Pillai's trace test under Gl(p) for suitable deviations from normality is pointed out.