Attainability of the Upper Bounds for the Mean Past Lifetime of Parallel System Components

Among reliability systems, one of the basic systems is a parallel system. In this article, we consider a parallel system consisting of n identical components with independent lifetimes having a common distribution function F. Under the condition that the system has failed by time t, with t being 100pth percentile of F(t = F ^?1(p), 0 < p < 1), we characterize the probability distributions based on the mean past lifetime of the components of the system. These distributions are described in the form of a specific shape on the left of t and arbitrary continuous function on the right tail.     

Allowance for skewness in maximum-likelihood estimation with application to the location-scale model

The use of maximum-likelihood estimation as discussed by Sprott and Viveros (1984) is extended to include the log F distribution to accommodate skewness. The role played by linear pivotals in relation to likelihood and efficiency is discussed. Normal, t, and log F likelihoods are defined and used to generate possible normal, t, and log F linear pivotal quantities. The results are applied to the location-scale family, where exact results are available to assess the numerical accuracy of the proposed procedure. Refinements using saddlepoint approximations are obtained.     

APPROXIMATION OF EXCEEDANCE PROCESSES IN LARGE POPULATIONS

We consider a population of n individuals. Each of these individuals generates a discrete time branching stochastic process. We study the number of ancestors S(n,t) whose offspring at time t exceeds level θ(t), where θ(t) is some positive valued function. It is proved that S(n,t) may be approximated as t → ∞ and n → ∞ by some stochastic processes with independent increments.

     

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)     

A bivariate F distribution with marginals on arbitrary numerator and denominator degrees of freedom, and related bivariate beta and t distributions

The classical bivariate F distribution arises from ratios of chi-squared random variables with common denominators. A consequent disadvantage is that its univariate F marginal distributions have one degree of freedom parameter in common. In this paper, we add a further independent chi-squared random variable to the denominator of one of the ratios and explore the extended bivariate F distribution, with marginals on arbitrary degrees of freedom, that results. Transformations linking F, beta and skew t distributions are then applied componentwise to produce bivariate beta and skew t distributions which also afford marginal (beta and skew t) distributions with arbitrary parameter values. We explore a variety of properties of these distributions and give an example of a potential application of the bivariate beta distribution in Bayesian analysis.     

Some representation theorems in terms of mean residual lifetime and mean inactivity time of coherent systems

Abstract

In this paper, we consider a k-out-of-n system consisting of n identical components with independent lifetimes. We show that when the underlying distribution function F(t) is absolutely continuous, then it can be univocally determined by some particular mean residual lives or mean inactivity times of the system. It is then shown that these results may be extended to coherent (or mixed) systems.     

Bayesian hypothesis testing for selected regression coefficients

ABSTRACT

We develop new Bayesian regression tests for prespecified regression coefficients. Simple, closed forms of the Bayes factors are derived that depend only on the regression t-statistic and F-statistic and the usual associated t and F distributions. The priors that allow those forms are simple and also meaningful, requiring minimal but practically important subjective inputs.     

Exact predictors for a generalized ar(1) process with an ar(1) parameter

The generalized AR(1) process y _t = a _t y _t-1+ v _t is considered, where the parameter a _t follows the AR(1) process a _t = Ga _t-1+ w _t.Assuming that V _t and w _t are Gaussian and independent, the first six exact predictors for future values of y _t are derived. These exact predictors are compared with Box-Jenkins -type approximations. MACSYMA, a computer algebra program, is utilized in the derivation of the predictors.     

Estimation of Parameters of a Clipped MA(1) Process

Let {X _t , t ∈ ?} be a sequence of iid random variables with an absolutely continuous distribution. Let a > 0 and c ∈ ? be some constants. We consider a sequence of 0-1 valued variables {ξ _t , t ∈ ?} obtained by clipping an MA(1) process X _t  ? aX _t?1 at the level c, i.e., ξ _t  = I[X _t  ? aX _t?1 < c] for all t ∈ ?. We deal with the estimation problem in this model. Properties of the estimators of the parameters a and c, the success probability p, and the 1-lag autocorrelation r ₁ are investigated. A numerical study is provided as an illustration of the theoretical results.     

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.     

Locking the Wiener Process to its Level-Crossing Time

We consider the specific transformation of a Wiener process {X(t), t ≥ 0} in the presence of an absorbing barrier a that results when this process is “time-locked” with respect to its first passage time T _a through a criterion level a, and the evolution of X(t) is considered backwards (retrospectively) from T _a . Formally, we study the random variables defined by Y(t) ≡ X(T _a  ? t) and derive explicit results for their density and mean, and also for their asymptotic forms. We discuss how our results can aid interpretations of time series “response-locked” to their times of crossing a criterion level.     

A Unified Way to Represent and Compute the Cumulative Distribution Function for Noncentral t,F, and χ2

This short article shows an unified approach to representing and computing the cumulative distribution function for noncentral t, F, and χ². Unlike the existing algorithms, which involve different expansion and/or recurrence, the new approach consistently represents all the three noncentral cumulative distribution functions as the integral of the normal cumulative distribution function and χ² density function.     

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.     

Estimation for semi-Markov models with partial observations via self-consistency equations

Nonparametric estimators of the survival function S(t) = P(T ≥ t) for a partially observed time variable T have been defined by several methods, in particular, by integral self-consistency equations. The author establishes explicit expressions of the estimators in an additive form and extend this approach to several cases: a left-truncated and right-censored variable and the left-censored or left-truncated sojourn times of a right-censored semi-Markov process. These estimators are always identical to the product-limit estimators if hazard functions may be defined.     

Uniform robustness against nonnormality of the t and f tests

The size of the two-sample t test is generally thought to be robust against nonnormal distributions if the sample sizes are large. This belief is based on central limit theory, and asymptotic expansions of the moments of the t statistic suggest that robustness may be improved for moderate sample sizes if the variance, skewness, and kurtosis of the distributions are matched, particularly if the sample sizes are also equal.

It is shown that asymptotic arguments such as these can be misleading and that, in fact, the size of the t test can be as large as unity if the distributions are allowed to be completely arbitrary. Restricting the distributions to be identical or symmetric (but otherwise arbitrary) does not guarantee that the size can be controlled either, but controlling the tail-heaviness of the distributions does. The last result is proved more generally for the k-sample F test.     

The Kumaraswamy skew-t distribution and its related properties

Skew normal distribution is an alternative distribution to the normal distribution to accommodate asymmetry. Since then extensive studies have been done on applying Azzalini’s skewness mechanism to other well-known distributions, such as skew-t distribution, which is more flexible and can better accommodate long tailed data than the skew normal one. The Kumaraswamy generalized distribution (Kw ? F) is another new class of distribution which is capable of fitting skewed data that can not be fitted well by existing distributions. Such a distribution has been widely studied and various versions of generalization of this distribution family have been introduced. In this article, we introduce a new generalization of the skew-t distribution based on the Kumaraswamy generalized distribution. The new class of distribution, which we call the Kumaraswamy skew-t (KwST) has the ability of fitting skewed, long, and heavy-tailed data and is more flexible than the skew-t distribution as it contains the skew-t distribution as a special case. Related properties of this distribution family such as mathematical properties, moments, and order statistics are discussed. The proposed distribution is applied to a real dataset to illustrate the estimation procedure.     

ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Consider an ergodic Markov chain X(t) in continuous time with an infinitesimal matrix Q = (q_ij) defined on a finite state space {0, 1,…, N}. In this note, we prove that if X(t) is skip-free positive (negative, respectively), i.e., q_ij, = 0 for j > i+ 1 (i > j+ 1), then the transition probability p_ij(t) = Pr[X(t)=j | X(0) =i] can be represented as a linear combination of p_0N(t) (p^(m)_(N0)(t)), 0 ≤ m ≤N, where f^(m)(t) denotes the mth derivative of a function f(t) with f⁽⁰⁾(t) =f(t). If X(t) is a birth-death process, then p_ij(t) is represented as a linear combination of p_0N^(m)(t), 0 ≤m≤N - |i-j|.     

First-exit times for compound poisson processes for some types of positive and negative jumps

We consider the one-sided and the two-sided first-exit problem for a compound Poisson process with linear deterministic decrease between positive and negative jumps. This process (X(t)) _t≥0 occurs as the workload process of a single-server queueing system with random workload removal, which we denote by M/G _u /G _d /1, where G _u (G _d ) stands for the distribution of the upward (downward) jumps; other applications are to cash management, dams, and several related fields. Under various conditions on G _u and G _d (assuming e.g. that one of them is hyperexponential, Erlang or Coxian), we derive the joint distribution of τ _y =inf{t≥0|X(t)?(0,y)}, y>0, and X(τ _y ) as well as that of T=inf{t≥0|X(t)≤0} and X(T). We also determine the distribution of sup{X(t)|0≤t≤T}.