On a problem of counting by weighing

Suppose it is desired to obtain a large number N_s of items for which individual counting is impractical, but one can demand a batch to weigh at least w units so that the number of items N in the batch may be close to the desired number N_s. If the items have mean weight ωTH, it is reasonable to have w equal to ωTHN_s when ωTH is known. When ωTH is unknown, one can take a sample of size n, not bigger than N_s, estimate ωTH by a good estimator ω_n, and set w equal to ω_nN_s. Let R_n = Kp²N²_s/n + K_sn be a measure of loss, where K_e and K_s are the coefficients representing the cost of the error in estimation and the cost of the sampling respectively, and p is the coefficient of variation for the weight of the items. If one determines the sample size to be the integer closest to pCN_s when p is known, where C is (K_e/K_s)^1/2, then R_n will be minimized. If p is unknown, a simple sequential procedure is proposed for which the average sample number is shown to be asymptotically equal to the optimal fixed sample size. When the weights are assumed to have a gamma distribution given ω and ω has a prior inverted gamma distribution, the optimal sample size can be found to be the nonnegative integer closest to pCN_s + p²A(pC – 1), where A is a known constant given in the prior distribution.     

Efficient estimates in linear and nonlinear regression with heteroscedastic errors

In this paper we consider the heteroscedastic regression model defined by the structural relation Y = r(V, β) + s(W)ε, where V is a p-dimensional random vector, W is a q-dimensional random vector, β is an unknown vector in some open subset B of R^m, r is a known function from R^p × B into R, s is an unknown function on R^q, and ε is an unobservable random variable that is independent of the pair (V, W). We construct asymptotically efficient estimates of the regression parameter β under mild assumptions on the functions r and s and on the distributions of ε and (V, W).     

Bounds for Expectations of Differences of Generalized Order Statistics Based on General and Life Distributions

Let X _? ^(r), r ≥ 1, denote generalized order statistics based on an arbitrary distribution function F with finite pth absolute moment for some 1 ≤ p ≤ ∞. We present sharp upper bounds on E(X _? ^(s) ? X _? ^(r)), 1 ≤ r < s, for F being either general or life distribution. The bounds are expressed in various scale units generated by pth central absolute or raw moments of F, respectively. The distributions achieving the bounds are specified.     

Some multivariate singular unified skew-normal distributions and their application

Abstract

We introduce here the truncated version of the unified skew-normal (SUN) distributions. By considering a special truncations for both univariate and multivariate cases, we derive the joint distribution of consecutive order statistics X_{(r, ..., r + k)} = (X_(r), ..., X_{(r + K)})^T from an exchangeable n-dimensional normal random vector X. Further we show that the conditional distributions of X_{(r + j, ..., r + k)} given X_{(r, ..., r + j ? 1)}, X_{(r, ..., r + k)} given (X_(r) > t)?and X_{(r, ..., r + k)} given (X_{(r + k)} < t) are special types of singular SUN distributions. We use these results to determine some measures in the reliability theory such as the mean past life (MPL) function and mean residual life (MRL) function.     

A Classification Rule Whose Probability of Misclassification is Independent of the Variance

An observation ×_o is to be classified into one of two normal populations φ₁ and φ₂. A classification rule, the Two-stage sample Rule, R(TS), whose probability of misclassification, P[MC], is independent of the common but unknown variance is proposed. Some optimal properties of R(TS) are also discussed and some values of P[MC | R(TS)], the probability of misclassification given the rule R(TS), are tabulated.     

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.     

Bias of the lse estimator of the first order autoregressive model under tukey contamination

Results of an exhaustive study of the bias of the least square estimator (LSE) of an first order autoregression coefficient α in a contaminated Gaussian model are presented. The model describes the following situation. The process is defined as X_t = α X_t-1 + Y_t . Until a specified time T, Y_t are iid normal N(0, 1). At the moment T we start our observations and since then the distribution of Y_t, t≥T, is a Tukey mixture T(εσ) = (1 – ε)N(0,1) + εN(0, σ²). Bias of LSE as a function of α and ε, and σ² is considered. A rather unexpected fact is revealed: given α and ε, the bias does not change montonically with σ (“the magnitude of the contaminant”), and similarly, given α and σ, the bias is not growing with ε (“the amount of contaminants”).     

Prediction based on linear combinations of order statistics and bivariate concomitants in the case of multivariate elliptical distributions

In this paper, by considering a (3n+1) -dimensional random vector (X₀, X^T, Y^T, Z^T)^T having a multivariate elliptical distribution, we derive the exact joint distribution of (X₀, a^TX_(n), b^TY_[n], c^TZ_[n])^T, where a, b, c∈?ⁿ, X_(n)=(X₍₁₎, …, X_(n))^T, X₍₁₎<···<X_(n), is the vector of order statistics arising from X, and Y_[n]=(Y_[1], …, Y_[n])^T and Z_[n]=(Z_[1], …, Z_[n])^T denote the vectors of concomitants corresponding to X_(n) ((Y_[r], Z_[r])^T, for r=1, …, n, is the vector of bivariate concomitants corresponding to X_(r)). We then present an alternate approach for the derivation of the exact joint distribution of (X₀, X_(r), Y_[r], Z_[r])^T, for r=1, …, n. We show that these joint distributions can be expressed as mixtures of four-variate unified skew-elliptical distributions and these mixture forms facilitate the prediction of X_(r), say, based on the concomitants Y_[r] and Z_[r]. Finally, we illustrate the usefulness of our results by a real data.     

Information Properties for Concomitants of Order Statistics in Farlie–Gumbel–Morgenstern (FGM) Family

Let (X _i , Y _i ), i = 1, 2,…, n be independent and identically distributed random variables from some continuous bivariate distribution. If X _(r) denotes the rth-order statistic, then the Y's associated with X _(r) denoted by Y _[r] is called the concomitant of the rth-order statistic. In this article, we derive an analytical expression of Shannon entropy for concomitants of order statistics in FGM family. Applying this expression for some well-known distributions of this family, we obtain the exact form of Shannon entropy, some of the information properties, and entropy bounds for concomitants of order statistics. Some comparisons are also made between the entropy of order statistics X _(r) and the entropy of its concomitants Y _[r]. In this family, we show that the mutual information between X _(r) and Y _[r], and Kullback–Leibler distance among the concomitants of order statistics are all distribution-free. Also, we compare the Pearson correlation coefficient between X _(r) and Y _[r] with the mutual information of (X _(r), Y _[r]) for the copula model of FGM family.     

Locally minimax tests for multiple correlations

Let X be a normally distributed p-dimensional column vector with mean μ and positive definite covariance matrix σ. and let X α, α = 1,…, N, be a random sample of size N from this distribution. Partition X as ( X ₁, X ₍₂₎', X '₍₃₎)', where X₁ is one-dimension, X₍₂₎ is p₂- dimensional, and so 1 + p₁ + p₂ = p. Let ρ₁ and ρ be the multiple correlation coefficients of X₁ with X₍₂₎ and with ( X '₍₂₎, X '₍₃₎)', respectively. Write ρ2/2 = ρ² - ρ2/1. We shall cosider the following two problems     

On some joint distributions in fluctuation theory

For non-negative integral valued interchangeable random variables v₁, v₂,…,v_n, Takács (1967, 70) has derived the distributions of the statistics ?_n' ?¹_n' ?^(c)_n and ?^(-c)_n concerning the partial sums N_r = v₁ + v₂ + ··· + v_rr = 1,…,n. This paper deals with the joint distributions of some other statistics viz., (α^(c)_n, δ^(c)_n, Z_n), (β^(c)_n, Z_n) and (β^(-c)_n, Z_n) concerning the partial sums N_r = ε₁ + ··· + ε_rr = 1,2,…,n, of geometric random variables ε₁, ε₂,…,ε_n.     

Theory of factorial designs of the parallel flats type. I: the coefficient matrix

Let GF(s) be the finite field with s elements.(Thus, when s=3, the elements of GF(s) are 0, 1 and 2.)Let A(r×n), of rank r, and c_i(i=1,…,f), (r×1), be matrices over GF(s). (Thus, for n=4, r=2, f=2, we could have A=[¹¹¹⁰₀₁₂₁], c₁=[¹₀], c₂=[⁰₂].) Let T_i (i=1,…,f) be the flat in EG(n, s) consisting of the set of all the s^n?r solutions of the equations At=c_i, wheret′=(t₁,…,t_n) is a vector of variables.(Thus, EG(4, 3) consists of the 3⁴=81 points of the form (t₁,t₂,t₃,t₄), where t's take the values 0,1,2 (in GF(3)). The number of solutions of the equations At=c_i is s^n?r, where r=Rank(A), and the set of such solutions is said to form an (n?r)-flat, i.e. a flat of (n?r) dimensions. In our example, both T₁ and T₂ are 2-flats consisting of 3^4?2=9 points each. The flats T₁,T₂,…,T_f are said to be parallel since, clearly, no two of them can have a common point. In the example, the points of T₁ are (1000), (0011), (2022), (0102), (2110), (1121), (2201), (1212) and (0220). Also, T₂ consists of (0002), (2010), (1021), (2101), (1112), (0120), (1200), (0211) and (2222).) Let T be the fractional design for a sⁿ symmetric factorial experiment obtained by taking T₁,T₂,…,T_f together. (Thus, in the example, 3⁴=81 treatments of the 3⁴ factorial experiment correspond one-one with the points of EG(4,3), and T will be the design (i.e. a subset of the 81 treatments) consisting of the 18 points of T₁ and T₂ enumerated above.)In this paper, we lay the foundation of the general theory of such ‘parallel’ types of designs. We define certain functions of A called the alias component matrices, and use these to partition the coefficient matrix X (n×v), occuring in the corresponding linear model, into components X._j(j=0,1,…,g), such that the information matrix X is the direct sum of the X′._jX._j. Here, v is the total number of parameters, which consist of (possibly μ), and a (general) set of (geometric) factorial effects (each carrying (s?1) degrees of freedom as usual). For j≠0, we show that the spectrum of X′._jX._j does not change if we change (in a certain important way) the usual definition of the effects. Assuming that such change has been adopted, we consider the partition of the X._j into the X_ij (i=1,…,f). Furthermore, the X_ij are in turn partitioned into smaller matrices (which we shall here call the) X_ijh. We show that each X_ijh can be factored into a product of 3 matrices J, ζ (not depending on i,j, and h) and Q(j,h,i)where both the Kronecker and ordinary product are used. We introduce a ring R using the additive groups of the rational field and GF(s), and show that the Q(j,h,i) belong to a ring isomorphic to R. When s is a prime number, we show that R is the cyclotomic field. Finally, we show that the study of the X._j and X′._jX._j can be done in a much simpler manner, in terms of certain relatively small sized matrices over R.     

A review of optimal designs in survey sampling

Results in five areas of survey sampling dealing with the choice of the sampling design are reviewed. In Section 2, the results and discussions surrounding the purposive selection methods suggested by linear regression superpopulation models are reviewed. In Section 3, similar models to those in the previous section are considered; however, random sampling designs are considered and attention is focused on the optimal choice of π_j. Then in Section 4, systematic sampling methods obtained under autocorrelated superpopulation models are reviewed. The next section examines minimax sampling designs. The work in the final section is based solely on the randomization. In Section 6 methods of sample selection which yield inclusion probabilities π_j = n/N and π_ij = n(n - 1)/N(N - 1), but for which there are fewer than _NC_n possible samples, are mentioned briefly.     

A Condition to Obtain the Same Decision in the Homogeneity Testing Problem from the Frequentist and Bayesian Point of View

We develop a Bayesian procedure for the homogeneity testing problem of r populations using r × s contingency tables. The posterior probability of the homogeneity null hypothesis is calculated using a mixed prior distribution. The methodology consists of choosing an appropriate value of π₀ for the mass assigned to the null and spreading the remainder, 1 ? π₀, over the alternative according to a density function. With this method, a theorem which shows when the same conclusion is reached from both frequentist and Bayesian points of view is obtained. A sufficient condition under which the p-value is less than a value α and the posterior probability is also less than 0.5 is provided.     

On characterizing distributions via regression of functions of generalized order statistics

Let X(1,n,m₁,k),X(2,n,m₂,k),…,X(n,n,m,k) be n generalized order statistics from a continuous distribution F which is strictly increasing over (a,b),−∞≤a<b≤∞, the support of F. Let g be an absolutely continuous and monotonically increasing function in (a,b) with finite g(a⁺),g(b⁻) and E(g(X)). Then for some positive integer s,1<s≤n, we give characterization of distributions by means of

     

Bayesian and Robust Bayesian analysis under a general class of balanced loss functions

For estimating an unknown parameter θ, we introduce and motivate the use of balanced loss functions of the form L_{r, w, d0}(q, d)=wr(d₀, d)+ (1-w) r(q, d){L_{\rho, \omega, \delta_0}(\theta, \delta)=\omega \rho(\delta_0, \delta)+ (1-\omega) \rho(\theta, \delta)}, as well as the weighted version q(q) L_{r, w, d0}(q, d){q(\theta) L_{\rho, \omega, \delta_0}(\theta, \delta)}, where ρ(θ, δ) is an arbitrary loss function, δ ₀ is a chosen a priori “target” estimator of q, w ? [0,1){\theta, \omega \in[0,1)}, and q(·) is a positive weight function. we develop Bayesian estimators under L_{r, w, d0}{L_{\rho, \omega, \delta_0}} with ω > 0 by relating such estimators to Bayesian solutions under L_{r, w, d0}{L_{\rho, \omega, \delta_0}} with ω = 0. Illustrations are given for various choices of ρ, such as absolute value, entropy, linex, and squared error type losses. Finally, under various robust Bayesian analysis criteria including posterior regret gamma-minimaxity, conditional gamma-minimaxity, and most stable, we establish explicit connections between optimal actions derived under balanced and unbalanced losses.     

Bayesian Estimation of Change Point in Inverse Weibull Sequence

A sequence of independent lifetimes X ₁,…, X _m , X _m+1,…, X _n were observed from inverse Weibull distribution with mean stress θ₁ and reliability R ₁(t ₀) at time t ₀ but later it was found that there was a change in the system at some point of time m and it is reflected in the sequence after X _m by change in mean stress θ₁ and in reliability R ₂(t ₀) at time t ₀. The Bayes estimators of m, R ₁(t ₀) and R ₂(t ₀) are derived when a poor and a more detailed prior information is introduced into the inferential procedure. The effects of correct and wrong prior information on the Bayes estimators are studied.     

Estimated Generalized Least Squares for a Heteroscedastic Regression Model

This paper considers the general linear regression model yc = X₁β+u_t under the heteroscedastic structure E(u_t) = 0, E(u²) =σ²- (X_tβ)², E(u_t u_s) = 0, tæs, t, s= 1, T. It is shown that any estimated GLS estimator for β is asymptotically equivalent to the GLS estimator under some regularity conditions. A three-step GLS estimator, which calls upon the assumption E(u_t²) =s?²(X,β)² for the estimation of the disturbance covariance matrix, is considered.     

THE CONVERGENCE RATE OF SEQUENTIAL FIXED-WIDTH CONFIDENCE INTERVALS FOR REGULAR FUNCTIONALS

Let X₁X₂,.be i.i.d. random variables and let U_n= (n r)^-1S?^(n,r) h (X_i1,., X_ir,) be a U-statistic with EU_n= v, v unknown. Assume that g(X₁) =E[h(X₁,.,X_r) - v |X₁]has a strictly positive variance s?². Further, let a be such that φ(a) - φ(-a) =α for fixed α, 0 < α < 1, where φ is the standard normal d.f., and let S²_n be the Jackknife estimator of n Var U_n. Consider the stopping times N(d)= min {n: S²_n: + n^-1≤²a^-2},d > 0, and a confidence interval for v of length 2d,of the form I_n,d= [U_n,-d, Un + d]. We assume that Var U_n is unknown, and hence, no fixed sample size method is available for finding a confidence interval for v of prescribed width 2d and prescribed coverage probability α Turning to a sequential procedure, let I_N(d),d be a sequence of sequential confidence intervals for v. The asymptotic consistency of this procedure, i.e. lim_{d → 0}P(v ∈ I_N(d),d)=α follows from Sproule (1969). In this paper, the rate at which |P(v ∈ I_N(d),d) converges to α is investigated. We obtain that |P(v ∈ I_N(d),d) - α| = 0 (d^{1/2-(1+k)/2(1+m)}), d → 0, where K = max {0,4 - m}, under the condition that E|h(X₁, X_r)|^m < ∞m > 2. This improves and extends recent results of Ghosh & DasGupta (1980) and Mukhopadhyay (1981).     

Addition of runs to a two-level supersaturated design

The purpose of this article is to introduce a new class of extended E(s²)-optimal two level supersaturated designs obtained by adding runs to an existing E(s²)-optimal two level supersaturated design. The extended design is a union of two optimal SSDs belonging to different classes. New lower bound to E(s²) has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(s²)-optimal SSDs are also included.