Stable estimation of location parameter -nonasymptotic approach

Let X₁:, X₂:, …, X_n be iidrv's with cdf F?, F?(x)=F (x-θ), R. Let T be an equivariant median-unbiased estimator of θ. Let πε(F)={G = (1 -ε) F+εH, H any cdf} and let M(G, T) be a median of T if X₁ has cdf G. The oscillation of the bias of T, defined as

Bε(T)=sup (M(G₁ T) :G₁,G₂:∈π_σ:(F)} ,is considered and the estimator with the smallest B$epsi;(T) is explicitly constructed     

Some subset selection problems

Consider that we have a collection of k populations π₁, π₂…,π_k. The quality of the ith population is characterized by a real parameter θ_i and the population is to be designated as superior or inferior depending on how much the θ_i differs from θ_max = max{θ₁, θ₂,…,θ_k}. From the set {π₁, π₂,…,π_k}, we wish to select the subset of superior populations. In this paper we devise rules of selection which have the property that their selected set excludes all the inferior populations with probability at least 1?α, where a is a specified number.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

Maximum likelihood estimation in the presence of outiliers

This paper deals with the maximum likelihood estimation of parameters when the sample (x₁…x_n ) may heve k spuriously generated observations from another distribution, say G≠F, where F is the distribution of the target population. If G is stochastically larger than F, then these k observations may give rise to k extreme observations or ‘outliers’. This situation is often described by a so-called ‘k-outlier model’ in which in addition to the parameters involved in F and G, the set ν={ν₁,…,ν_k} of indices, for which x_νj , j=1,…,k, come from G, is also unknow.     

Partial and inverse autocorrelations in portmanteau-type tests for time series

We present a decomposition of the correlation coefficient between x_t and x_t?k into three terms that include the partial and inverse autocorrelations. The first term accounts for the portion of the autocorrelation that is explained by the inner variables {x_t?1 , x_t?2 , …, x _{t? k+1}}, the second one measures the portion explained by the outer variables {x _t+1, x _t+2, } ∪ {x _t?k?1, x _t?k?2,…} and the third term measures the correlation between x _t and x_t?k given all other variables. These terms, squared and summed, can form the basis of three portmanteau-type tests that are able to detect both deviation from white noise and lack of fit of an entertained model. Quantiles of their asymptotic sample distributions are complicated to derive at an adequate level of accuracy, so they are approximated using the Monte Carlo method. A simulation experiment is carried out to investigate significance levels and power of each test, and compare them to the portmanteau test.     

DECOMPOSITION OF A SEMI-MARKOV PROCESS UNDER A MARKOVIAN RULE

Consider a semi-Markov process {X(t), t>0} with transition epochs T₀ T₁, T₂…. Suppose that at each one of the epochs {T_n} one of R possible events, E₁, E₂,…, E_R can happen, where the occurrences of successive events form a Markov chain. for a fixed r, let the times the event E_r happens be U_o U₁, U₂,…. In this paper we are interested in the process {Y(t), t>0)} where Y(t)=X(U_k) if and only if U_k≤tk+1. It will be shown that {Y(t)} is a semi-Markov process, and its properties with respect to those of {X(t)} will be examined.     

Estimation of the derivative of a density and related functions

Let Y₁,…,Y _n, (Y₁ <Y₂<…<Y _n) be the order statistics of a random sample from a distribution F with density f on the realline. This paper gives a class of estimators of the derivativef'(x) of the density f at points x for which f has

a continuoussecond derivative. These estimators are based on spacings inthe order statistics Y_j+kn -y _j j = 1,…,n-k_n,k_n<n.     

A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

Limiting distributions of Kolmogorov-Lévy-type statistics under the alternative

Let X_i, 1 ≤ i ≤ n, be independent identically distributed random variables with a common distribution function F, and let G be a smooth distribution function. We derive the limit distribution of □{ρ_α(F_n, G) - _α(F, G)}, where F_n is the empirical distribution function based on X₁,…,X_n and _α is a Kolmogorov-Lévy-type metric between distribution functions. For α ≤ 0 and two distribution functions F and G the metric p_α is given by p_α(F, G) = inf {? ≤ 0: G(x - α?) - ? F(x) ≤ G(x + α?) + ? for all x ?}.     

Concerning the vector v(m,t)

Let q = mt + 1 be a prime power, and let v(m, t) be the (m + 1)-vector (b₁, b₂, …, b_{m + 1}) of elements of GF(q) such that for each k, 1 ⩽ k ⩽ m + 1, the set {b_i−b_j:i∈{1,2,…m+1} − {m + 2 − k}, j  i + k(mod m + 2) and 1⩽j⩽m+1} forms a system of representatives for the cyclotomic classes of index m in GF(q). In this paper, we investigate the existence of such vectors. An upper bound on t for the existence of a v(m, t) is given for each fixed m unless both m and t are even, in which case there is no such a vector. Some special cases are also considered.     

PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS

ABSTRACT

A basic difficulty in dealing with heavy-tailed distributions is that they may not have explicit Laplace transforms. This makes numerical methods that use the Laplace transform more challenging. This paper generalizes an existing method for approximating heavy-tailed distributions, for use in queueing analysis. The generalization involves fitting Chebyshev polynomials to a probability density function g(t) at specified points t ₁, t ₂, …, t _N . By choosing points t _i , which rapidly get far out in the tail, it is possible to capture the tail behavior with relatively few points, and to control the relative error in the approximation. We give numerical examples to evaluate the performance of the method in simple queueing problems.     

A one-sided test for testino homogeneity of scale parameters against simple ordered alternative

In an earlier paper the authors (1997) extended the results of Hayter (1990) to the two parameter exponential probability model. This paper addressee the extention to the scale parameter case under location-scale probability model. Consider k (k≧3) treatments or competing firms such that an observation from with treatment or firm follows a distribution with cumulative distribution function (cdf) F_i(x)=F[(x-μ_i)/Q_i], where F(·) is any absolutely continuous cdf, i=1,…,k. We propose a test to test the null hypothesis H₀:θ₁=…=θ_k against the simple ordered alternative H₁:θ₁≦…≦θ_k, with at least one strict inequality, using the data X_i,j, i=1,…k; j=1,…,n₁. Two methods to compute the critical points of the proposed test have been demonstrated by talking k two parameter exponential distributions. The test procedure also allows us to construct simultaneous one sided confidence intervals (SOCIs) for the ordered pairwise ratios θ_j/θ_i, 1≦i<j≦k. Statistical simulation revealed that: 9i) actual sizes of the critical points are almost conservative and (ii) power of the proposed test relative to some existing tests is higher.     

Heine process as a q-analog of the Poisson process—waiting and interarrival times

In this study, we introduce the Heine process, {X_q(t), t > 0}, 0 < q < 1, where the random variable X_q(t), for every t > 0, represents the number of events (occurrences or arrivals) during a time interval (0, t]. The Heine process is introduced as a q-analog of the basic Poisson process. Also, in this study, we prove that the distribution of the waiting time W_{ν, q}, ν ? 1, up to the νth arrival, is a q-Erlang distribution and the interarrival times T_{k, q} = W_{k, q} ? W_{k ? 1, q},?k = 1, 2, …, ν with W_{0, q} = 0 are independent and equidistributed with a q-Exponential distribution.     

A lower bound for the transition density function of a stochastic differential equation

Let W_t be a one-dimensional Brownian motion on the probability space (Ω,F,P), and let dx_t = a(x_t)dt + b(x_t)dw_t, b²(x) > 0, be a one-dimensional Ito stochastic differential equation. For a(x) = a₀ + a₁x + … + a_nxⁿ on a bounded interval we obtain a lower bound for p(t,x,y), the transition density function of the homogeneous Markov process x_t, depending directly on the coefficients a₀,a₁, …, a_n, and b(x).     

Estimation of the Scale Parameter of the Selected Gamma Population Under the Entropy Loss Function

Let X ₁, X ₂,…, X _k be k (≥2) independent random variables from gamma populations Π₁, Π₂,…, Π _k with common known shape parameter α and unknown scale parameter θ _i , i = 1,2,…,k, respectively. Let X _(i) denotes the ith order statistics of X ₁,X ₂,…,X _k . Suppose the population corresponding to largest X _(k) (or the smallest X ₍₁₎) observation is selected. We consider the problem of estimating the scale parameter θ _M (or θ _J ) of the selected population under the entropy loss function. For k ≥ 2, we obtain the Unique Minimum Risk Unbiased (UMRU) estimator of θ _M (and θ _J ). For k = 2, we derive the class of all linear admissible estimators of the form cX ₍₂₎ (and cX ₍₁₎) and show that the UMRU estimator of θ _M is inadmissible. The results are extended to some subclass of exponential family.     

On Censored Bivariate Random Variables: Copula,Characterization, and Estimation

Let (X, Y) be a bivariate random vector with joint distribution function F_{X, Y}(x, y) = C(F(x), G(y)), where C is a copula and F and G are marginal distributions of X and Y, respectively. Suppose that (X_i, Y_i), i = 1, 2, …, n is a random sample from (X, Y) but we are able to observe only the data consisting of those pairs (X_i, Y_i) for which X_i ? Y_i. We denote such pairs as (X*_i, Y_i*), i = 1, 2, …, ν, where ν is a random variable. The main problem of interest is to express the distribution function F_{X, Y}(x, y) and marginal distributions F and G with the distribution function of observed random variables X* and Y*. It is shown that if X and Y are exchangeable with marginal distribution function F, then F can be uniquely determined by the distributions of X* and Y*. It is also shown that if X and Y are independent and absolutely continuous, then F and G can be expressed through the distribution functions of X* and Y* and the stress–strength reliability P{X ? Y}. This allows also to estimate P{X ? Y} with the truncated observations (X*_i, Y_i*). The copula of bivariate random vector (X*, Y*) is also derived.     

A CHARACTERIZATION OF GEOMETRIC DISTRIBUTIONS THROUGH CONDITIONAL INDEPENDENCE

Let X₁,…, X_n be mutually independent non-negative integer-valued random variables with probability mass functions f_i(x) > 0 for z= 0,1,…. Let E denote the event that {X₁≥X₂≥…≥X_n}. This note shows that, conditional on the event E, X_i-X_i+ 1 and X_i+ 1 are independent for all t = 1,…, k if and only if X_i (i= 1,…, k) are geometric random variables, where 1 ≤k≤n-1. The k geometric distributions can have different parameters θ_i, i= 1,…, k.     

Mixed covering arrays of strength three with few factors

Covering arrays with mixed alphabet sizes, or mixed covering arrays, are useful generalizations of covering arrays that are motivated by software and network testing. Suppose that there are k factors, and that the ith factor takes values or levels from a set G_i of size g_i. A run is an assignment of an admissible level to each factor. A mixed covering array, MCA(N;t,k,g₁g₂…g_k), is a collection of N runs such that for any t distinct factors, i₁,i₂,…,i_t, every t-tuple from G_i1×G_i2×?×G_it occurs in factors i₁,i₂,…,i_t in at least one of the N runs. When g=g₁=g₂=?=g_k, an MCA(N;t,k,g₁g₂…g_k) is a CA(N;t,k,g). The mixed covering array number, denoted by MCAN(t,k,g₁g₂…g_k), is the minimum N for which an MCA(N;t,k,g₁g₂…g_k) exists. In this paper, we focus on the constructions of mixed covering arrays of strength three. The numbers MCAN(3,k,g₁g₂…g_k) are determined for all cases with k∈{3,4} and for most cases with k∈{5,6}.     

Distributions minimizing fisher information for scale in kolmogorov neighbourhoods

We construct those distributions minimizing Fisher information for scale in Kolmogorov neighbourhoods K_?(G) = {F|sup_x|F(x) - G(x| ? ?} of d.f.'s G satisfying certain mild conditions. The theory is sufficiently general to include those cases in which G is normal, Laplace, logistic, Student's t, etc. As well, we consider G(x) = 1 - e^-x, ? 0, and correct some errors in the literature concerning this case.     

Asymptotic expaxsioxs for the joint distribution of cirrelated hotellings t2 statlstics under normality

Let T² _i=z′_iS^?1z_i, i==,…k be correlated Hotelling's T² statistics under normality. where z=(z′_i,…,z′_k)′ and nS are independently distributed as N_kp((O,ρ?∑) and Wishart distribution W_p(∑, n), respectively. The purpose of this paper is to study the distribution function F(x₁,…,x_k) of (T² _i,…,T² _k) when n is large. First we derive an asymptotic expansion of the characteristic function of (T² _i,…,T² _k) up to the order n^?2. Next we give asymptotic expansions for (T² _i,…,T² _k) in two cases (i)ρ=I_k and (ii) k=2 by inverting the expanded characteristic function up to the orders n^?2 and n^?1, respectively. Our results can be applied to the distribution function of max (T² _i,…,T² _k) as a special case.