On the Failure Probability of Used Coherent Systems

In analyzing the lifetime properties of a coherent system, the concept of “signature” is a useful tool. Let T be the lifetime of a coherent system having n iid components. The signature of the system is a probability vector s=(s₁, s₂, …, s_n), such that s_i=P(T=X_i:n), where, X_i:n, i=1, 2, …, n denote the ordered lifetimes of the components. In this note, we assume that the system is working at time t>0. We consider the conditional signature of the system as a vector in which the ith element is defined as p_i(t)=P(T=X_i:n|T>t) and investigate its properties as a function of time.     

DECOMPOSITIONS OF THE QUEUE LENGTH DISTRIBUTIONS IN THE MAP/G/1 QUEUE UNDER MULTIPLE AND SINGLE VACATIONS WITH N-POLICY

In this paper, we establish an explicit form of matrix decompositions for the queue length distributions of the MAP/G/1 queues under multiple and single vacations with N-policy. We show that the vector generating function Y (z) of the queue length at an arbitrary time and X (z) at departures are decomposed into Y (z) = p _idle (z)ζ _Y (z) and X (z) = p _idle (z)ζ _X (z) where p _idle (z) is the vector generating function of the queue length at an arbitrary epoch at which the server is not in service, and ζ _Y (z) and ζ _X (z) are unidentified matrix generating functions.     

A study of generalized skew-normal distribution

Following the paper by Genton and Loperfido [Generalized skew-elliptical distributions and their quadratic forms, Ann. Inst. Statist. Math. 57 (2005), pp. 389–401], we say that Z has a generalized skew-normal distribution, if its probability density function (p.d.f.) is given by f(z)=2φ _p (z; ξ, Ω)π (z?ξ), z∈? ^p , where φ _p (·; ξ, Ω) is the p-dimensional normal p.d.f. with location vector ξ and scale matrix Ω, ξ∈? ^p , Ω>0, and π is a skewing function from ? ^p to ?, that is 0≤π (z)≤1 and π (?z)=1?π (z), ? z∈? ^p . First the distribution of linear transformations of Z are studied, and some moments of Z and its quadratic forms are derived. Next we obtain the joint moment-generating functions (m.g.f.’s) of linear and quadratic forms of Z and then investigate conditions for their independence. Finally explicit forms for the above distributions, m.g.f.’s and moments are derived when π (z)=κ (α′z), where α∈? ^p and κ is the normal, Laplace, logistic or uniform distribution function.     

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

     

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 Estimation of a Distribution Function under Quadrant Dependence

LetX₁,X₂, ..., be real-valued random variables forming a strictly stationary sequence, and satisfying the basic requirement of being either pairwise positively quadrant dependent or pairwise negatively quadrant dependent. LetF^ be the marginal distribution function of theX_ips, which is estimated by the empirical distribution functionF_n and also by a smooth kernel-type estimateF_n, by means of the segmentX₁, ...,X_n. These estimates are compared on the basis of their mean squared errors (MSE). The main results of this paper are the following. Under certain regularity conditions, the optimal bandwidth (in the MSE sense) is determined, and is found to be the same as that in the independent identically distributed case. It is also shown thatn MSE(F_n(t)) andnMSE (F^_n(t)) tend to the same constant, asn→∞ so that one can not discriminate be tween the two estimates on the basis of the MSE. Next, ifi(n) = min {k∈{1, 2, ...}; MSE (F_k(t)) ≤ MSE (F_n(t))}, then it is proved thati(n)/n tends to 1, asn→∞. Thus, once again, one can not choose one estimate over the other in terms of their asymptotic relative efficiency. If, however, the squared bias ofF^_n(t) tends to 0 sufficiently fast, or equivalently, the bandwidthh_n satisfies the requirement thatnh³_n→ 0, asn→∞, it is shown that, for a suitable choice of the kernel, (i(n) ?n)/(nh_n) tends to a positive number, asn→∞ It follows that the deficiency ofF_n(t) with respect toF^_n(t),i(n) ?n, is substantial, and, actually, tends to ∞, asn→∞. In terms of deficiency, the smooth estimateF^_n(t) is preferable to the empirical distribution functionF_n(t)     

Three-term asymptotic expansion: A semi-Markovian random walk with a generalized beta distributed interference of chance

A semi-Markovian random walk process (X(t)) with a generalized beta distribution of chance is considered. The asymptotic expansions for the first four moments of the ergodic distribution of the process are obtained as E(ζ_n) → ∞ when the random variable ζ_n has a generalized beta distribution with parameters (s, S, α, β); ?α, β > 1,?0? ? s < S < ∞. Finally, the accuracy of the asymptotic expansions is examined by using the Monte Carlo simulation method.     

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.     

The T-type estimate of a class of partially non linear models

Abstract

This paper considers a partially non linear model E(Y|X, z, t) = f(X, β) + z^Tg(t) and gives its T-type estimate, which is a weighted quasi-likelihood estimate using sieve method and can be obtained by EM algorithm. The influence functions and asymptotic properties of T-type estimate (consistency and asymptotic normality) are discussed, and convergence rate of both parametric and non parametric components are obtained. Simulation results show the shape of influence functions and prove that the T-type estimate performs quite well. The proposed estimate is also applied to a data set and compared with the least square estimate and least absolute deviation estimate.     

ON THE NUMBER OF RECORDS NEAR THE MAXIMUM

Recent work has considered properties of the number of observations X_j, independently drawn from a discrete law, which equal the sample maximum X_(n) The natural analogue for continuous laws is the number K_n(a) of observations in the interval (X_(n)–a, X_(n)], where a > 0. This paper derives general expressions for the law, first moment, and probability generating function of K_n(a), mentioning examples where evaluations can be given. It seeks limit laws for n→ and finds a central limit result when a is fixed and the population law has a finite right extremity. Whenever the population law is attracted to an extremal law, a limit theorem can be found by letting a depend on n in an appropriate manner; thus the limit law is geometric when the extremal law is the Gumbel type. With these results, the paper obtains limit laws for ‘top end’ spacings X_(n) - X_(n-j) with j fixed.     

ON A SHARED ALLELE TEST OF RANDOM MATING

A simple random sample is observed from a population with a large number‘K’ of alleles, to test for random mating. Of n couples, n_ijkl have female genotype ij and male genotype kl (i, j, k, l{1,…, A‘}). The large contingency table is collapsed into three counts, n₀, n₁ and n₂ where n_p is the number of couples with s alleles in common (s = 0,1, 2). The counts are estimated by np?_o where n₀, is the estimated probability of a couple having s alleles in common under the hypothesis of random mating. The usual chi-square goodness of fit statistic X² compares observed (n_s) with expected (np?) over the three categories, s = 0,1,2. An empirical observation has suggested that X² is close to having a chi-square distribution with two degrees of freedom (X) despite a large number of parameters implicitly estimated in _e. This paper gives two theorems which show that x is indeed the approximate distribution of X² for large n and K₁“, provided that no allele type over-dominates the others.     

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.     

On Sampling Designs for Integral Estimation of a Random Process

Abstract

In this paper the problem of finding exactly optimal sampling designs for estimating the weighted integral of a stochastic process with a product covariance structure (R(s,t)=u(s)v(t), s<t) is discussed. The sampling designs for certain standard processes belonging to the product class are calculated. An asymptotic solution to the design problem also follows as a consequence.     

Long-range correlation analysis of the Wichmann-Hill random number generator

The distribution of points (r _n,r _n+s), n = 0, 1, 2,...whose coordinates are terms at distance s of the pseudorandom sequence generated by the Wichmann and Hill method is studied. It is known that for many congruential generators critical values of the distance s exist such that these points, far from being uniformly distributed, are concentrated on very few lines. An algorithm is described for computing the critical distances within the Wichmann-Hill sequence and the results obtained are compared with those of other linear congruential generators.     

Model fitting and inference under latent equilibrium processes

This paper presents a methodology for model fitting and inference in the context of Bayesian models of the type f(Y | X,θ)f(X|θ)f(θ), where Y is the (set of) observed data, θ is a set of model parameters and X is an unobserved (latent) stationary stochastic process induced by the first order transition model f(X ^(t+1)|X ^(t),θ), where X ^(t) denotes the state of the process at time (or generation) t. The crucial feature of the above type of model is that, given θ, the transition model f(X ^(t+1)|X ^(t),θ) is known but the distribution of the stochastic process in equilibrium, that is f(X|θ), is, except in very special cases, intractable, hence unknown. A further point to note is that the data Y has been assumed to be observed when the underlying process is in equilibrium. In other words, the data is not collected dynamically over time. We refer to such specification as a latent equilibrium process (LEP) model. It is motivated by problems in population genetics (though other applications are discussed), where it is of interest to learn about parameters such as mutation and migration rates and population sizes, given a sample of allele frequencies at one or more loci. In such problems it is natural to assume that the distribution of the observed allele frequencies depends on the true (unobserved) population allele frequencies, whereas the distribution of the true allele frequencies is only indirectly specified through a transition model. As a hierarchical specification, it is natural to fit the LEP within a Bayesian framework. Fitting such models is usually done via Markov chain Monte Carlo (MCMC). However, we demonstrate that, in the case of LEP models, implementation of MCMC is far from straightforward. The main contribution of this paper is to provide a methodology to implement MCMC for LEP models. We demonstrate our approach in population genetics problems with both simulated and real data sets. The resultant model fitting is computationally intensive and thus, we also discuss parallel implementation of the procedure in special cases.     

Asymptotic Properties of Random Weighted Empirical Distribution Function

This article studies the asymptotic properties of the random weighted empirical distribution function of independent random variables. Suppose X₁, X₂, ???, X_n is a sequence of independent random variables, and this sequence is not required to be identically distributed. Denote the empirical distribution function of the sequence by F_n(x). Based on the random weighting method and F_n(x), the random weighted empirical distribution function H_n(x) is constructed and the asymptotic properties of H_n are discussed. Under weak conditions, the Glivenko–Cantelli theorem and the central limit theorem for the random weighted empirical distribution function are obtained. The obtained results have also been applied to study the distribution functions of random errors of multiple sensors.     

Confidence intervals for lognormal regression and a non-parametric alternative

Approximate confidence intervals are given for the lognormal regression problem. The error in the nominal level can be reduced to O(n ^?2), where n is the sample size. An alternative procedure is given which avoids the non-robust assumption of lognormality. This amounts to finding a confidence interval based on M-estimates for a general smooth function of both ? and F, where ? are the parameters of the general (possibly nonlinear) regression problem and F is the unknown distribution function of the residuals. The derived intervals are compared using theory, simulation and real data sets.     

Do bootstrap confidence procedures behave well uniformly in P?

An important statistical problem is to construct a confidence set for some functional T(P) of some unknown probability distribution P. Typically, this involves approximating the sampling distribution J_n(P) of some pivot based on a sample of size n from P. A bootstrap procedure is to estimate J_n(P) by J_n(&Pcirc;_n), where P?_n is the empirical measure based on a sample of size n from P. Typically, one has that J_n(P) and J_n(P?_n) are close in an appropriate sense. Two questions are addressed in this note. Are J_n(P) and J_n(P?_n) uniformly close as P varies as well? If so, do confidence statements about T(P) possess a corresponding uniformity property? In the case T(P) = P, the answer to the first questions is yes; the answer to the second is no. However, bootstrap confidence statements about T(P) can be made uniform over a restricted, though large, class of P. Similar results apply to other functional T(P).