A consistent test for multivariate normality based on the empirical characteristic function

LetX ₁,X ₂, …,X _n be independent identically distributed random vectors in IR ^d ,d ⩾ 1, with sample mean and sample covariance matrixS _n. We present a practicable and consistent test for the composite hypothesisH _d: the law ofX ₁ is a non-degenerate normal distribution, based on a weighted integral of the squared modulus of the difference between the empirical characteristic function of the residualsS _n ^−1/2 (X _j − ) and its pointwise limit exp (−1/2|t|²) underH _d. The limiting null distribution of the test statistic is obtained, and a table with critical values for various choices ofn andd based on extensive simulations is supplied.     

Locally minimax test of independence in elliptically symmetrical distributions with additional observations

Summary LetX=(X _ij )=(X ₁, ...,X _n )’,X’ _i =(X _i1, ...,X _ip )’,i=1,2, ...,n be a matrix having a multivariate elliptical distribution depending on a convex functionq with parameters, 0,σ. Let ϱ²=ϱ ₂ ^-2 be the squared multiple correlation coefficient between the first and the remainingp ₂+p ₃=p−1 components of eachX _i . We have considered here the problem of testingH ₀:ϱ²=0 against the alternativesH ₁:ϱ ₁ ^-2 =0, ϱ ₂ ^-2 >0 on the basis ofX andn ₁ additional observationsY ₁ (n ₁×1) on the first component,n ₂ observationsY ₂(n ₂×p ₂) on the followingp ₂ components andn ₃ additional observationsY ₃(n ₃×p ₃) on the lastp ₃ components and we have derived here the locally minimax test ofH ₀ againstH ₁ when ϱ ₂ ^-2 →0 for a givenq. This test, in general, depends on the choice ofq of the familyQ of elliptically symmetrical distributions and it is not optimality robust forQ.     

Distributions determined by conditioning on a pair of order statistics

LetX ₁,X ₂, ...,X _n (n≥3) be a random sample on a random variableX with distribution functionF having a unique continuous inverseF ⁻¹ over (a,b), −∞≤a<b≤∞ the support ofF. LetX _1:n <X _2:n <...<X _n:n be the corresponding order statistics. Letg be a nonconstant continuous function over (a,b). Then for some functionG over (a, b) and for some positive integersr ands, 1<r+1<s≤n

Largest excess of boundary crossings for martingales

Summary LetX ₁,X ₂, ... form a sequence of martingale differences and denote byZ(a, α) = sup n (S _n −an ^α)⁺ the largest excess forS _n =X ₁ + ... +X _n crossing the boundaryan ^α. We give a sufficient condition for the finiteness ofEZ(a, α)^β which is formulated in terms of bounds forE(X _i ^{+ p} andE(|X _i |γ|X ₁, ...,X _i-1), whereα, β, γ, p are suitably related. This general result is then applied to the case of independent random variables.     

Strong consistency of the MLE under random censoring

LetX ₁, ...,X _n be an i.i.d. sample from some parametric family {_θ :θ (Θ} of densities. In the random censorship model one observesZ _i =min (X _i ,Y _i ) andδ _i =1_{ x _i ≤Y _i}, whereY _i is a censoring variable being independent ofX _i . In this paper we investigate the strong consistency ofθ _n maximizing the modified likelihood function based on (Z _i ,δ _i , 1≤i≤n. The main result constitutes an extension of Wald’s theorem for complete data to censored data. Work partially supported by the “Deutsche Forschungsgemeinschaft”.     

Characterization of the multivariate normal distribution by conditional normal distributions

Summary LetX andY be two random vectors with values in ℝ ^k and ℝ∝, respectively. IfZ=(X ^T,Y ^T) ^T is multivariate normal thenX givenY=y andY givenX=x are (multivariate) normal; the converse is wrong. In this paper simple additional conditions are stated such that the converse is true, too. Furthermore, the case is treated that the random vectorZ=(X ₁ ^T , …,X _t ^T ) ^T is splitted intot≥3 partsX ₁, …,X _t.     

Nonparametric regression function estimation using interaction least squares splines and comlexity regularization

Let (X, Y) be a pair of random variables withsupp(X)⊆[0,1] ^l andEY ²<∞. Letm ^* be the best approximation of the regression function of (X, Y) by sums of functions of at mostd variables (1≤d≤l). Estimation ofm ^* from i.i.d. data is considered. For the estimation interaction least squares splines, which are defined as sums of polynomial tensor product splines of at mostd variables, are used. The knot sequences of the tensor product splines are chosen equidistant. Complexity regularization is used to choose the number of the knots and the degree of the splines automatically using only the given data. Without any additional condition on the distribution of (X, Y) the weak and strongL ₂-consistency of the estimate is shown. Furthermore, for everyp≥1 and every distribution of (X, Y) withsupp(X)⊆[0,1] ^l ,y bounded andm ^* p-smooth, the integrated squared error of the estimate achieves up to a logarithmic factor the (optimal) rate      

Multivariate likelihood ratio orderings between spacings of heterogeneous exponential random variables

Let X ₁, X ₂, ..., X _n be independent exponential random variables such that X _i has failure rate λ for i = 1, ..., p and X _j has failure rate λ^* for j = p + 1, ..., n, where p ≥ 1 and q = n − p ≥ 1. Denote by D _i:n (p,q) = X _i:n −X _i-1:n the ith spacing of the order statistics X _1:n ≤ X _2:n ≤ ... ≤ X _n:n , i = 1, ..., n, where X _0:n ≡ 0. The purpose of this paper is to investigate multivariate likelihood ratio orderings between spacings D _i:n (p,q), generalizing univariate comparison results in Wen et al.(J Multivariate Anal 98:743–756, 2007). We also point out that such multivariate likelihood ratio orderings do not hold for order statistics instead of spacings. Supported by National Natural Science Foundation of China, the Program for New Century Excellent Talents in University (No.: NCET-04-0569), and by the Knowledge Innovation Program of the Chinese Academy of Sciences (No.: KJCX3-SYW-S02).     

Two-sample rank tests with truncated populations

LetX ₁,…,X _m andY ₁,…,Y _n be two independent samples from continuous distributionsF andG respectively. Using a Hoeffding (1951) type theorem, we obtain the distributions of the vector S=(S ₍₁₎,…,S _(n)), whereS _(j)=# (X _i ’s≤Y _(j)) andY _(j) is thej-th order statistic ofY sample, under three truncation models: (a)G is a left truncation ofF orG is a right truncation ofF, (b)F is a right truncation ofH andG is a left truncation ofH, whereH is some continuous distribution function, (c)G is a two tail truncation ofF. Exploiting the relation between S and the vectorR of the ranks of the order statistics of theY-sample in the pooled sample, we can obtain exact distributions of many rank tests. We use these to compare powers of the Hajek test (Hajek 1967), the Sidak Vondracek test (1957) and the Mann-Whitney-Wilcoxon test. We derive some order relations between the values of the probagility-functions under each model. Hence find that the tests based onS ₍₁₎ andS _(n) are the UMP rank tests for the alternative (a). We also find LMP rank tests under the alternatives (b) and (c).     

A bound on the expected overshoot for some concave boundaries

LetX ₁,X ₂,… be i.i.d. with finite meanμ>0,S _n =X ₁+…+X _n . Forf(n)=n ^β ,c>0 we consider the stopping timesT _c =inf{n:S _n >c+f(n)} with overshootR _c =S _{T c} −(c+f(T _c )). For 0<β<1 we give a bound for sup _c≥0 ER _c in the spirit of Lorden’s well-known inequality forf=0.     

Sulla somma di due numeri aleatori egualmente distribuiti

In questo lavoro si studia il problema di ricerca della distribuzione di probabilità comune da assegnare a due numeri aleatori discreti che assumano i primin valori interi naturali in modo che la loro somma abbia moda di minima probabilità.Il problema è affrontato sia dal punto di vista teorico tramite gli strumenti della programmazione matematica, sia dal punto di vista numerico.

---

LetX andY be two random numbers with the same distribution function; in this paper we consider the problem of finding a random numberX+Y having mode with minimal probability. In particular we have considered only the case ofX andY assuming the firstn integer values, so thatp (dimensionn) is the common distribution andq (dimension 2n–1) is the distribution ofX+Y; then the problem is to minimizem=maxq ₁.In the known literature it appears that theoretical results and numerical experience have brought to various conjectures not confermed. In this paper the problem is considered from the mathematical programming point of view. Several theoretical results are obtained even if the full solution of the problem is not reached. Anyway, such results, limiting the search range of a solution, suggested extended numerical testing, also for rather large values ofn, so that non trivial conclusions can be derived.

---

---

Pervenuto il 22-1-82     

A note on generalized wald’s method

Let {v _n(θ)} be a sequence of statistics such that whenθ =θ ₀,v _n(θ ₀) N _p(0,Σ), whereΣ is of rankp andθ εR ^d. Suppose that underθ =θ ₀, {Σ _n} is a sequence of consistent estimators ofΣ. Wald (1943) shows thatv _n ^T (θ ₀)Σ _n ⁻¹ v _n(θ ₀) x ²(p). It often happens thatv _n(θ ₀) N _p(0,Σ) holds butΣ is singular. Moore (1977) states that under certain assumptionsv _n ^T (θ ₀)Σ _n ⁻ v _n(θ ₀) x ²(k), wherek = rank (Σ) andΣ _n ⁻ is a generalized inverse ofΣ _n. However, Moore’s result as stated is incorrect. It needs the additional assumption that rank (Σ _n) =k forn sufficiently large. In this article, we show that Moore’s result (as corrected) holds under somewhat different, but easier to verify, assumptions. Research partly supported by the U.S. Army Research Office through the Mathematical Sciences Institute at Cornell University.     

A note on reliability properties of k-record statistics

LetY _k,n denote the nth (upper) k-record value of an infinite sequence of independent, identically distributed random variables with common continuous distribution function F. We show that if the nth k-record valueY _k,n has an increasing failure rate (IFR), thenY _l,n (l<k) andY _k+1,n+1(n≤k+1) also have IFR distributions. On the other hand, ifY _k,n has a decreasing failure rate (DFR), thenY _l,n (1>k) has also a DFR distribution. We also present some results concerning log convexity and log concavity ofY _k,n .     

A measure of mutual complete dependence

Two random variables X and Y on a common probability space are mutually completely dependent (m.c.d.) if each one is a function of the other with probability one. For continuous X and Y, a natural approach to constructing a measure of dependence is via the distance between the copula of X and Y and the independence copula. We show that this approach depends crucially on the choice of the distance function. For example, the L ^p -distances, suggested by Schweizer and Wolff, cannot generate a measure of (mutual complete) dependence, since every copula is the uniform limit of copulas linking m.c.d. variables. Instead, we propose to use a modified Sobolev norm, with respect to which mutual complete dependence cannot approximate any other kind of dependence. This Sobolev norm yields the first nonparametric measure of dependence which, among other things, captures precisely the two extremes of dependence, i.e., it equals 0 if and only if X and Y are independent, and 1 if and only if X and Y are m.c.d. Examples are given to illustrate the difference to the Schweizer–Wolff measure.     

Linearity of regression for non-adjacent order statistics

Let X ₁,X ₂,…,X _n be a random sample from a continuous distribution with the corresponding order statistics X _1:n≤X _2:n≤…≤X _n:n. All the distributions for which E(X _{k+r: n}|X _k:n)=a X _k:n+b are identified, which solves the problem stated in Ferguson (1967). Received February 1998     

Estimating a restricted normal mean

Let X ₁, X ₂, ..., X _n be a random sample from a normal distribution with unknown mean μ and known variance σ ². In many practical situations, μ is known a priori to be restricted to a bounded interval, say [−m, m] for some m > 0. The sample mean , then, becomes an inadmissible estimator for μ. It is also not minimax with respect to the squared error loss function. Minimax and other estimators for this problem have been studied by Casella and Strawderman (Ann Stat 9:870–878, 1981), Bickel (Ann Stat 9:1301–1309, 1981) and Gatsonis et al. (Stat Prob Lett 6:21–30, 1987) etc. In this paper, we obtain some new estimators for μ. The case when the variance σ ² is unknown is also studied and various estimators for μ are proposed. Risk performance of all estimators is numerically compared for both the cases when σ ² may be known and unknown.     

Some properties of the minimum and the maximum of random variables with joint logconcave distributions

It is shown that if (X ₁, X ₂, . . . , X _n ) is a random vector with a logconcave (logconvex) joint reliability function, then X _P = min _i∈P X _i has increasing (decreasing) hazard rate. Analogously, it is shown that if (X ₁, X ₂, . . . , X _n ) has a logconcave (logconvex) joint distribution function, then X ^P  = max _i∈P X _i has decreasing (increasing) reversed hazard rate. If the random vector is absolutely continuous with a logconcave density function, then it has a logconcave reliability and distribution functions and hence we obtain a result given by Hu and Li (Metrika 65:325–330, 2007). It is also shown that if (X ₁, X ₂, . . . , X _n ) has an exchangeable logconcave density function then both X _P and X ^P have increasing likelihood ratio.     

Estimating the conditional mode of a stationary stochastic process from noisy observations

Let {(X _i, Y _i,)}, i≥1, be a strictly stationary process from noisy observations. We examine the effect of the noise in the response Y and the covariates X on the nonparametric estimation of the conditional mode function. To estimate this function we are using deconvoluting kernel estimators. The asymptotic behavior of these estimators depends on the smoothness of the noise distribution, which is classified as either ordinary smooth or super smooth. Uniform convergence with almost sure convergence rates is established for strongly mixing stochastic processes, when the noise distribution is ordinary smooth. Received: April 1998