Choice of best linear in the guass-markoff model with a singular dispersion matrix

In this paper we obtain the complete class of representations and useful subclasses of MV-UB-LE and MV-MB-LE (minimum variance unbiased and minimum bias linear estimators) of linear parametric functions in the Gauss-Markoff model (Y,Xβ, σ ²V) when V is possibly singular.     

Unbiased estimation of a nonlinear function a normal mean with application to measurement err oorf models

Let W be a normal random variable with mean μand known variance σ². Conditions on the function f(·) are given under which there exists an unbiased estimator, f(W), of f(μ) for all real μ. In particular it is shown that f(·) must be an entire function over the complex plane. Infinite series solutions for F(·) are obtained which are shown to be valid under growth conditions of the derivatives, f^k( ·), of f(·). Approximate solutions are given for the cases in which no exact solution exists. The theory is applied to nonlinear measurement-error models as a means of finding unbiased score functions when measurement error is normally distributed. Relative efficiencies comparing the proposed method to the use of conditional scores (Stefanski and Carroll, 1987) are given for the Poisson regression model with canonical link.     

Efficient sequential estimation in a markov branching process with immigration

Sequential estimation of parameters In a continuous time Markov branching process with Immigration with split rate λ₁ Immigration rate λ₂, offspring distribution {p₁j≥O) and Immigration distribution {p₂j≥l} is considered. A sequential version of the Cramér-Rao type information inequality is derived which gives a lower bound on the variances of unbiased estimators for any function of these parameters. Attaining the lower bounds depends on whether the sampling plan or stopping rule S, the estimator f, and the parametric function g = E(f) are efficient. All efficient triples (S,f,g) are characterized; It Is shown that for i = 1,2, only linear combinations of λ_ip_{ij j}'s or their ratios are efficiently estimable. Applications to a Yule process, a linear birth and death process with immigration and an M/M/∞ queue are also considered     

On the differences of two generalized negative binomial variates

The generalized negative binomial (GNB) distribution was defined by Jain and Consul (SIAM J. Appl. Math., 21 (1971)) and was obtained as a particular family of Lagrangian distributions by Consul and Shenton (SIAM J. Appl. Math., 23 (1973)). Consul and Shenton also gave the probability generating function (p.g.f.) and proved many properties of the GNBD. Consul and Gupta (SIAM J. Appl. Math., 39 (1980)) proved that the parameter β must be either zero or 1≤ β ≤ θ^-1 for the GNBD to be a true probability distribution and proved some other properties. Numerous applications and properties of this model have been studied by various researchers. Considering two independent GNB variates X and Y, with parameters (m,β,θ) and (n,β,θ) respectively, the probability distribuition of D = Y-X and its p.g.f. and cumulant generating function have been obtained. A recurrence relation between the cumulants has been established and the first four cumulants, β₁ and β₂ have been derived. Also some moments of the absolute difference |Y-X| have been obtained.     

Efficient sequential estimation in multiplicative counting processes

The problem of efficient sequential estimation is counting processes with multiplicative intensity processes is considered. A sequential version of Cramér-Rao type information inequality is obtained and all the 'efficient' triples (S, f, g) are characterized: the variance of an unbiased estimator f for g attains the lower bound under a sampling plan S. Applications to Poisson processes, Markov processes, birth and death processes and Markov branching processes with immigration are also considered.     

Tests for detecting overdispersion in poisson models

Collings and Margolin(1985) developed a locally most powerful unbiased test for detecting negative binomial departures from a Poisson model, when the variance is a quadratic function of the mean. Kim and Park(1992) developed a locally most powerful unbiased test, when the variance is a linear function of the mean. It is found that a different mean-variance structure of a negative binomial derives a different locally optimal test statistic.

In this paper Collings and Margolin's and Kim and Park's results are unified and extended by developing a test for overdispersion in Poisson model against Katz family of distributions, Our setup has two extensions: First, Katz family of distributions is employed as an extension of the negative binomial distribution. Second, the mean-variance structure of the mixed Poisson model is given by σ² = μ+cμ^r for arbitrary but fixed r. We derive a local score test for testing H₀ : c = 0. Superiority of a new test is proved by the asymtotic relative efficiency as well as the simulation study.     

Linear Models in a general parametric form

The linear model Y - N(Xb, σ²∑) with a restriction R'b = M'u + c is considered, where X, R, M, ∑ and c are known. Explicit formulae are obtained for the best linear unbiased estimator of K'b, for the F-test of the hypothesis K'b = W'v + a, and for the simultaneous confidence intervals of the parameters K′_i b' s, where K = [K₁,K₂,…K_s], w, and a are known, none of the matrices X, ∑, R, M, K, and W is required to have full ranks, and the design X can be one - or multi-way,complete or incomplete, balanced or not balanced, connected or disconnected.     

Best quadratic and positive semidefinite unbiased estimation of the variance matrix of the multivariate normal distribution

A BQPUE (best quadratic and positive semidefinite unbiased estimator) of the matrix V for the distribution vec X^′∽N_np(vec M^′, U?V) is being given. It is unique, although still depending on U and M. When U = I and M = (μ,…,μ), we get a well-known (unique) result not depending on M.     

Optimality of blue's in a general linear model with incorrect design matrix

We consider the Gauss-Markoff model (Y,X₀β,σ²V) and provide solutions to the following problem: What is the class of all models (Y,Xβ,σ²V) such that a specific linear representation/some linear representation/every linear representation of the BLUE of every estimable parametric functional p'β under (Y,X₀β,σ²V) is (a) an unbiased estimator, (b) a BLUE, (c) a linear minimum bias estimator and (d) best linear minimum bias estimator of p'β under (Y,Xβ,σ²V)? We also analyse the above problems, when attention is restricted to a subclass of estimable parametric functionals.     

Least squares theory for possibly singular models

In a recent paper, Scobey (1975) observed that the usual least squares theory can be applied even when the covariance matrix σ²V of Y in the linear model Y = Xβ + e is singular by choosing the Moore-Penrose inverse (V+XX′)⁺ instead of V^-1 when V is nonsingular. This result appears to be wrong. The appropriate treatment of the problem in the singular case is described.     

Singular gauss-markov models

For the general linear model Y = X$sZ + e in which e has a singular dispersion matrix $sG²A, $sG > 0, where A is n x n and singular, Mitra [2] considers the problem of testing F$sZ, where F is a known q x q matrix and claims that the sum of squares (SS) due to hypothesis is not distributed (as a x² variate with degrees of freedom (d. f.) equal to the rank of F) independent of the SS due to error, when a generalized inverse of A is chosen as (A + X'X)^–. This claim does not hold if a pseudo-inverse of A is taken to be (A + X'X)⁺ where A⁺ denotes the unique Moore-Penrose inverse (MPI) of A.     

The asymptotic unbiasedness of S2 in the linear regression model with AR(1)-disturbances

The OLS-estimator of the disturbance variance in the Linear Regression Model is shown to be asymptotically unbiased in the context of AR(1)-disturbances, although for any given design, E(s²/σ²) tends to zero as correlation increases.     

Distributions of certain variables in samples from two-parameter exponential distribution

Cumulative distribution function of the variable Y=(U+c)/(Z/2ν)) is given. Here U and Z are independent random variables, U has the exponential distribution (1.1) with θ=0, σ=1, Z has the distribution χ² (2ν) and c is a real quantity. The variable Y with U and Z given by (2.2) and (2.3) is used for inference about the parametric functions ?=θ?kσ of a two-parameter exponential distribution (1.1) with k or ? known. Special cases of ? or k are: the parameter θ, the Pth quantile Xp, the mean θ+σ and the value of the cumulative distribution function or of the reliability function at given point a. Also one-sided tolerance limits for a two-parameter exponential distribution can be derived from the distribution of the variable Y. The results are also applied to the Pareto distribution.     

Exact factorization of the spectral density ann its application to wrf,castiilg and time series analysis

Let f be the spectral density function of a purely nondeterministic stationary stochastic process and be the optimal (canonical) fator of f. The role of the coefficients c_n and d_n (n ≥ 0) of φ and φ^?1 respectivey, in prediction, filtering and control theory is well-knwn. We show that the c_n's and d_n's can be obtained recursively in terms of the Fourier coefficients of log f. Also, recursive and updating formulae fr the kolmogorovwiener predictor similar to those Box-Jenkins are provided..     

On Bounds for Probability Generating Functions

Brook (1966) gave an upper bound for the moment generating function (m.g.f.) of a positive random variable (r.v.) in terms of its moments, and used this to obtain an upper bound for the probability generating function (p.g.f.) and hence the extinction probability of a simple branching process. Agresti (1974) rederived this bound of the p.g.f. and used it to obtain a lower bound of the expectation of extinction time of a branching process. In both of these applications the random variable is integer valued, and for this class we improve on Brook's bound by deriving the best upper bound of the p.g.f. Our method, which is a variant of Brook's (1966) is used later to obtain the lower bound of the p.g.f. when the third moment is also known.     

On the problem of augmented fractional factorial designs

Let D be a saturated fractional factorial design of the general K₁ x K₂ ...x K_t factorial such that it consists of m distinct treatment combinations and it is capable of providing an unbiased estimator of a subvector of m factorial parameters under the assumption that the remaining k-m,t (k = H it ) factorial parameters are negligible. Such a design will not provide an unbiased estimator of the varianceσ² Suppose that D is an optimal design with respect to some optimality criterion (e.g. d-optimality, a-optimality or e-optimality) and it is desirable to augment D with c treatmentcombinations with the aim to estimate ² Suppose that D is an optimal design with respect to some optimality criterion (e.g. d-optimality, a-optimality or e-optimality) and it is desirable to augment D with c treatment combinations with the aim to estimate σ² unbiasedly. The problem then is how to select the c treatment combinations such that the augmented design D retains its optimality property. This problem, in all its generality is extremely complex. The objective of this paper is to provide some insight in the problem by providing a partial answer in the case of the 2^tfactorial, using the d-optimality criterion.     

Unverfälschte Variablenprüfpläne für exponentialverteilte Merkmale mit zweiseitigen Toleranzgrenzen

As a well known fact the standard X²-procedures (e.g. confidence intervals for σ², tests of the hypothesis H:″σ=σ_o″ in the case of normal population with variance σ²) are biased. We refer to some useful tables which enable in the case of normal population to procure unbiased confidence intervals or confidence intervals with minimal length for σ², control charts for σ with minimal distance between the limit lines, and unbiased tests of H:″σ=σ_o″. Another important application yields—as main result of the present paper—unbiased sampling plans in the case of an exponential distributed attribute with upper and lower specification limit (two-way-protection). It turns out to be possible, also in the case of exponential distribution, to reduce the sample size by using incomplete prior information about the proportion p of defectives.     

Decomposition for multivariate extremal processes

The probability distribution of an extremal process in R^d with independent max-increments is completely determined by its distribution function. The df of an extremal process is similar to the cdf of a random vector. It is a monotone function on (0, ∞) × R^d with values in the interval [0,1]. On the other hand the probability distribution of an extremal process is a probability measure on the space of sample functions. That is the space of all increasing right continuous functions y: (0, ∞) → R^d with the topology of weak convergence. A sequence of extremal processes converges in law if the probability distributions converge weakly. This is shown to be equivalent to weak convergence of the df's.

An extremal process Y: [0, ∞) → R^d is generated by a point process on the space [0, ∞) × [-∞, ∞)^d and has a decomposition Y = X v Z as the maximum of two independent extremal processes with the same lower curve as the original process. The process X is the continuous part and Z contains the fixed discontinuities of the process Y. For a real valued extremal process the decomposition is unique: for a multivariate extremal process uniqueness breaks down due to blotting.     

MINIMUM MSE ESTIMATION BY LINEAR COMBINATIONS OF ORDER STATISTICS1

In this paper we assume that in a random sample of size ndrawn from a population having the pdf f(x; θ) the smallest r₁ observations and the largest r₂ observations are censored (r₁0, r₂0). We consider the problem of estimating θ on the basis of the middle n-r₁-r₂ observations when either f(x;θ)=θ^-1f(x/θ) or f(x;θ) = (aθ)¹f(x-θ)/aθ) where f(·) is a known pdf, a (<0) is known and θ (>0) is unknown. The minimum mean square error (MSE) linear estimator of θ proposed in this paper is a “shrinkage” of the minimum variance linear unbiased estimator of θ. We obtain explicit expressions of these estimators and their mean square errors when (i) f(·) is the uniform pdf defined on an interval of length one and (ii) f(·) is the standard exponential pdf, i.e., f(x) = exp(–x), x0. Various special cases of censoring from the left (right) and no censoring are considered.