Sensitivity analysis in principal component analysis:influence on the subspace spanned by principal components.

The problem of detecting influential observations in principalcomponent analysis was discussed by several authors. Radhakrishnan and kshirsagar ( 1981 ), Critchley ( 1985 ), jolliffe ( 1986 )among others discussed this topicby using the influence functions I(X;θ_s)and I(X;V_s)of eigenvalues and eigenvectors, which wwere derived under the assumption that the eigenvalues of interest were simple. In this paper we propose the influence functionsI(X;∑^q _s=1θ_sV_sV_s ^T)and I(x;∑^q _s=1V_sV_s ^t)(q<p;p:number of variables) to investigate the influence onthe subspace spanned by principal components. These influence functions are applicable not only to the case where the edigenvalues of interst are all simple but also to the case where there are some multiple eigenvalues among those of interest.     

An inclusion-consistent solution to the problem of absurd confidence statements: 2. Consistent nonexact-confidence-interval estimation

Two consistent nonexact-confidence-interval estimation methods, both derived from the consistency-equivalence theorem in Plante (1991), are suggested for estimation of problematic parametric functions with no consistent exact solution and for which standard optimal confidence procedures are inadequate or even absurd, i.e., can provide confidence statements with a 95% empty or all-inclusive confidence set. A belt C(·) from a consistent nonexact-belt family, used with two confidence coefficients (γ = inf_θ P_θ [ θ ? C(X)] and γ⁺ = sup_θ P_θ[θ ? C(X)], is shown to provide a consistent nonexact-belt solution for estimating μ₂ -μ₁ in the Behrens-Fisher problem. A rule for consistent behaviour enables any confidence belt to be used consistently by providing each sample point with best upper and lower confidence levels [δ⁺(x) ≥ γ⁺, δ(x) ≤ γ], which give least-conservative consistent confidence statements ranging from practically exact through informative to noninformative. The rule also provides a consistency correction L(x) = δ⁺(x)-δ(X) enabling alternative confidence solutions to be compared on grounds of adequacy; this is demonstrated by comparing consistent conservative sample-point-wise solutions with inconsistent standard solutions for estimating μ₂/μ₁ (Creasy-Fieller-Neyman problem) and $\sqrt {\mu _1^2 + \mu _2^2 }$, a distance-estimation problem closely related to Stein's 1959 example     

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.     

CERTAIN BOUNDS CONCERNING CHARACTERISTIC FUNCTIONS1

The largest value of the constant c for which holds over the class of random variables X with non-zero mean and finite second moment, is c=π. Let the random variable (r.v.) X with distribution function F(·) have non-zero mean and finite second moment. In studying a certain random walk problem (Daley, 1976) we sought a bound on the characteristic function of the form for some positive constant c. Of course the inequality is non-trivial only provided that . This note establishes that the best possible constant c =π. The wider relevance of the result is we believe that it underlines the use of trigonometric inequalities in bounding the (modulus of a) c.f. (see e.g. the truncation inequalities in §12.4 of Loève (1963)). In the present case the bound thus obtained is the best possible bound, and is better than the bound (2) |1-?(θ)| ≥ |θEX|-θ²EX²\2 obtained by applying the triangular inequality to the relation which follows from a two-fold integration by parts in the defining equation (*). The treatment of the counter-example furnished below may also be of interest. To prove (1) with c=π, recall that sin u > u(1-u/π) (all real u), so Since |E sinθX|-|E sin(-θX)|, the modulus sign required in (1) can be inserted into (4). Observe that since sin u > u for u < 0, it is possible to strengthen (4) to (denoting max(0,x) by x₊) To show that c=π is the best possible constant in (1), assume without loss of generality that EX > 0, and take θ > 0. Then (1) is equivalent to (6) c < θEX²/{EX-|1-?(θ)|/θ} for all θ > 0 and all r.v.s. X with EX > 0 and EX². Consider the r.v. where 0 < x < 1 and 0 < γ < ∞. Then EX=1, EX²=1+γx², From (4) it follows that |1-?(θ)| > 0 for 0 < |θ| <π|EX|/EX² but in fact this positivity holds for 0 < |θ| < 2π|EX|/EX² because by trigonometry and the Cauchy-Schwartz inequality, |1-?(θ)| > |Re(1-?(θ))| = |E(1-cosθX)| = 2|E sin²θX/2| (10) >2(E sinθX/2)² (11) >(|θEX|-θ²EX²/2π)²/2 > 0, the inequality at (11) holding provided that |θEX|-θ²EX²/2π > 0, i.e., that 0 < |θ| < 2π|EX|/EX². The random variable X at (7) with x= 1 shows that the range of positivity of |1-?(θ)| cannot in general be extended. If X is a non-negative r.v. with finite positive mean, then the identity shows that (1-?(θ))/iθEX is the c.f. of a non-negative random variable, and hence (13) |1-?(θ)| < |θEX| (all θ). This argument fans if pr{X < 0}pr{X> 0} > 0, but as a sharper alternative to (14) |1-?(θ)| < |θE|X||, we note (cf. (2) and (3)) first that (15) |1-?(θ)| < |θEX| +θ²EX²/2. For a bound that is more precise for |θ| close to 0, |1-?(θ)|²= (Re(1-?(θ)))²+ (Im?(θ))² <(θ²EX²/2)²+(|θEX| +θ²EX²_-/π)², so (16) |1-?(θ)| <(|θEX| +θ²EX²_-/π) + |θ|³(EX²)²/8|EX|.     

Randomly weighted sums and their maxima with heavy-tailed increments and dependence structure

Consider the randomly weighted sums S_m(θ) = ∑^m_{i = 1}θ_iX_i, 1 ? m ? n, and their maxima M_n(θ) = max?_{1 ? m ? n}S_m(θ), where X_i, 1 ? i ? n, are real-valued and dependent according to a wide type of dependence structure, and θ_i, 1 ? i ? n, are non negative and arbitrarily dependent, but independent of X_i, 1 ? i ? n. Under some mild conditions on the right tails of the weights θ_i, 1 ? i ? n, we establish some asymptotic equivalence formulas for the tail probabilities of S_n(θ) and M_n(θ) in the case where X_i, 1 ? i ? n, are dominatedly varying, long-tailed and subexponential distributions, respectively.     

Asymptotic tail behavior of a random sum with conditionally dependent subexponential summands

In this paper, we obtain some results for the asymptotic behavior of the tail probability of a random sum S_τ = ∑^τ_{k = 1}X_k, where the summands X_k, k = 1, 2, …, are conditionally dependent random variables with a common subexponential distribution F, and the random number τ is a non negative integer-valued random variable, independent of {X_k: k ? 1}.     

Estimating population size with truncated sampling

Let X₁, X₂,…,X_n be independent, indentically distributed random variables with density f(x,θ) with respect to a σ-finite measure μ. Let R be a measurable set in the sample space X. The value of X is observable if X ? (X?R) and not otherwise. The number J of observable X’s is binomial, N, Q, Q = 1?P(X ? R). On the basis of J observations, it is desired to estimate N and θ. Estimators considered are conditional and unconditional maximum likelihood and modified maximum likelihood using a prior weight function to modify the likelihood before maximizing. Asymptotic expansions are developed for the [Ncirc]’s of the form [Ncirc] = N + α√N + β + o_p(1), where α and β are random variables. All estimators have the same α, which has mean 0, variance σ² (a function of θ) and is asymptotically normal. Hence all are asymptotically equivalent by the usual limit distributional theory. The β’s differ and Eβ can be considered an “asymptotic bias”. Formulas are developed to compare the asymptotic biases of the various estimators. For a scale parameter family of absolutely continuous distributions with X = (0,∞) and R = (T,∞), special formuli are developed and a best estimator is found.     

On the admissibility of c[Xbar] + d with respect to the linex loss function

Let X₁, …,X_n be a random sample from a normal distribution with mean θ and variance σ² The problem is to estimate θ with loss function L(θ,e) = v(e-θ) where v(x) = b(exp(ax)-ax-l) and where a, b are constants with b>0, a¦0. Zellner (1986), showed that [Xbar] ? σ²a/2n dominates [Xbar] and hence [Xbar] is inadmissible. The question of what values of c and d render c[Xbar]+ d admissible is studied here.     

Two stochastic models for the geeta distribution

The first stochastic model is based upon two urns A and B, where A contains a fixed number of white and black balls and B is empty. The player selects an integer β ≥, 2 and draws the balls one by one (with replacement) from urn A and balls of the same colour are put in urn B. The process is continued as long as the number of white balls in B exceeds (β-1) times the number of black balls in B. The player stops after drawing β(x-1) balls and is declared to be a winner if urn B has (x-1) black balls. It is shown that x has the Geeta distribution.

Assuming that the mean μ is a function of two parameters θ and β it has been shown that for small changes inthe value of θ there exists a difference-differential equation which leads to the Geeta distribution.     

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.     

Some robust tests of independence in symmetrical multivariate distributions

Let X =(x)^ij=(11¹, …, X,)_T, i = l, …n, be an n X random matrix having multivariate symmetrical distributions with parameters μ, Σ. The p-variate normal with mean μ and covariance matrix is a member of this family. Let be the squared multiple correlation coefficient between the first and the succeeding p₁ components, and let p² = + be the squared multiple correlation coefficient between the first and the remaining p₁ + p₂ =p – 1 components of the p-variate normal vector. We shall consider here three testing problems for multivariate symmetrical distributions. They are (A) to test p² =0 against; (B) to test against =0, 0; (C) to test against p² =0, We have shown here that for problem (A) the uniformly most powerful invariant (UMPI) and locally minimax test for the multivariate normal is UMPI and is locally minimax as p² 0 for multivariate symmetrical distributions. For problem (B) the UMPI and locally minimax test is UMPI and locally minimax as for multivariate symmetrical distributions. For problem (C) the locally best invariant (LBI) and locally minimax test for the multivariate normal is also LBI and is locally minimax as for multivariate symmetrical distributions.     

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     

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 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|.     

On the bounded regret of empirical bayes estimators

Let (θ₁,x₁),…,(θ_n,x_n) be independent and identically distributed random vectors with E(xθ) = θ and Var(x|θ) = a + bθ + cθ². Let t_i be the linear Bayes estimator of θ_i and θ~_i be the linear empirical Bayes estimator of θ_i as proposed in Robbins (1983). When Ex and Var x are unknown to the statistician. The regret of using θ~_i instead of t_i because of ignorance of the mean and the variance is r_i = E(θ_i ? θ_i)² ?E(t_i ?θ_i)². Under appropriate conditions cumulative regret R_n = r₁+…r_n is shown to have a finite limit even when n tends to infinity. The limit can be explicitly computed in terms of a,b,c and the first four moments of x.     

Lower percentage points of hartley's extremal quotient statistic and their applications

Consider K(>2) independent populations π₁,..,π _k such that observations obtained from π _k are independent and normally distributed with unknown mean µ _i and unknown variance θ _i i = 1,…,k. In this paper, we provide lower percentage points of Hartley's extremal quotient statistic for testing an interval hypothesisH ₀ θ _[k] θ _[k] > δ vs. H _a : θ _[k] θ _[1] ≤ δ , where δ ≥ 1 is a predetermined constant and θ _[k](θ _[1]) is the max (min) of the θ_i,…,θ _k . The least favorable configuration (LFC) for the test under H ₀ is determined in order to obtain the lower percentage points. These percentage points can also be used to construct an upper confidence bound for θ_[k]/θ_[1].     

Confidence sets based on the positive part James–Stein estimator with the asymptotically constant coverage probability

The asymptotic expansions for the coverage probability of a confidence set centred at the James–Stein estimator presented in our previous publications show that this probability depends on the non-centrality parameter τ² (the sum of the squares of the means of normal distributions). In this paper we establish how these expansions can be used for a construction of confidence region with constant confidence level, which is asymptotically (the same formula for both case τ→0 and τ→∞) equal to some fixed value 1?α. We establish the shrinkage rate for the confidence region according to the growth of the dimension p and also the value of τ for which we observe quick decreasing of the coverage probability to the nominal level 1?α. When p→∞ this value of τ increases as O(p^1/4). The accuracy of the results obtained is shown by the Monte-Carlo statistical simulations.     

A predictive approach for the selection of a fixed number of good treatments

This paper offers a predictive approach for the selection of a fixed number (= t) of treatments from k treatments with the goal of controlling for predictive losses. For the ith treatment, independent observations X _ij (j = 1,2,…,n) can be observed where X _ij ’s are normally distributed N(θ _i ; σ ²). The ranked values of θ _i ’s and X _i ’s are θ ₍₁₎ ≤ … ≤ θ _(k) and X _[1] ≤ … ≤ X _[k] and the selected subset S = {[k], [k? 1], … , [k ? t+1]} will be considered. This paper distinguishes between two types of loss functions. A type I loss function associated with a selected subset S is the loss in utility from the selector’s view point and is a function of θ _i with i ? S. A type II loss function associated with S measures the unfairness in the selection from candidates’ viewpoint and is a function of θ _i with i ? S. This paper shows that under mild assumptions on the loss functions S is optimal and provides the necessary formulae for choosing n so that the two types of loss can be controlled individually or simultaneously with a high probability. Predictive bounds for the losses are provided, Numerical examples support the usefulness of the predictive approach over the design of experiment approach.     

Nuisance Parameters and the Use of Exploratory Graphical Methods in a Bayesian Analysis

Consider the problem of inference about a parameter θ in the presence of a nuisance parameter v. In a Bayesian framework, a number of posterior distributions may be of interest, including the joint posterior of (θ, ν), the marginal posterior of θ, and the posterior of θ conditional on different values of ν. The interpretation of these various posteriors is greatly simplified if a transformation (θ, h(θ, ν)) can be found so that θ and h(θ, v) are approximately independent. In this article, we consider a graphical method for finding this independence transformation, motivated by techniques from exploratory data analysis. Some simple examples of the use of this method are given and some of the implications of this approximate independence in a Bayesian analysis are discussed.