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

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.     

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

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

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.     

Convergence of a branching type recursion with non-stationary immigration

The asymptotic distribution of a branching type recursion with non-stationary immigration is investigated. The recursion is given by , where (X _l ) is a random sequence, (L _n ⁻¹⁽¹⁾ ) are iid copies ofL _n−1,K is a random number andK, (L _n ⁻¹⁽¹⁾ ), {(X _l ),Y _n } are independent. This recursion has been studied intensively in the literature in the case thatX _l ≥0,K is nonrandom andY _n =0 ∀n. Cramer, Rüschendorf (1996b) treat the above recursion without immigration with starting conditionL ₀=1, and easy to handle cases of the recursion with stationary immigration (i.e. the distribution ofY _n does not depend on the timen). In this paper a general limit theorem will be deduced under natural conditions including square-integrability of the involved random variables. The treatment of the recursion is based on a contraction method. The conditions of the limit theorem are built upon the knowledge of the first two moments ofL _n . In case of stationary immigration a detailed analysis of the first two moments ofL _n leads one to consider 15 different cases. These cases are illustrated graphically and provide a straight forward means to check the conditions and to determine the operator whose unique fixed point is the limit distribution of the normalizedL _n .     

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     

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

The average number of events per time unit and its estimation

Let ζ _t be the number of events which will be observed in the time interval [0;t] and define as the average number of events per time unit if this limit exists. In the case of i.i.d. waiting-times between the events,E[ζ _t ] is the renewal function and it follows from well-known results of renewal theory thatA exists and is equal to 1/τ, if τ>0 is the expectation of the waiting-times. This holds true also when τ = ∞.A may be estimate by ζ _t /t or where is the mean of the firstn waiting-timesX ₁,X ₂, ...,X _n . Both estimators converage with probability 1 to 1/τ if theX _i are i.i.d.; but the expectation of may be infinite for alln and also if it is finite, is in general a positively biased estimator ofA. For a stationary renewal process, ζ _t /t is unbiased for eacht; if theX _i are i.i.d. with densityf(x), then ζ _t /t has this property only iff(x) is of the exponential type and only for this type the numbers of events in consecutive time intervals [0,t], [t, 2t], ... are i.i.d. random variables for arbitraryt > 0.     

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.     

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.     

On the power function of the exact test for ther×c contingency table

Summary LetN=[n _ij ] (i=1, …,r;j=1, …,c) be the matrix of observed frequencies in anr×c contingency table fromr possibly different multinomial populations with respective probabilitiesp _i =(p _i1, …,p _ic ).Freeman andHalton have proposed an exact conditional test for the hypothesisH ₀ :p _i =(p ₁, …p _c ) of the exact test is derived. Numerical values forβ(p) were previously computed for the special case:r=3,c=2 [Bennett andNakamura, 1964].     

Asymptotic results and tests for the choice of approximative models in nonlinear two-phases regression models, heteroscedatic case

This paper is devoted to the study of the least squares estimator of f for the classical, fixed design, nonlinear model X (t _i)=f(t _i)+ε(t _i), i=1,2,…,n, where the (ε(t _i))_i=1,…,n are independent second order r.v.. The estimation of f is based upon a given parametric form. In Brodeau (1993) this subject has been studied in the homoscedastic case. This time we assume that the ε(t _i) have non constant and unknown variances σ²(t _i). Our main goal is to develop two statistical tests, one for testing that f belongs to a given class of functions possibly discontinuous in their first derivative, and another for comparing two such classes. The fundamental tool is an approximation of the elements of these classes by more regular functions, which leads to asymptotic properties of estimators based on the least squares estimator of the unknown parameters. We point out that Neubauer and Zwanzig (1995) have obtained interesting results for connected subjects by using the same technique of approximation. Received: February 1996     

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.     

Locally minimax tests for a multinormal data problem

LetX be ap-normal random vector with unknown mean and unknown covariance matrix and letX be partitioned asX=(X ₍₁₎ ,X ₍₂₎ , ...,X _(r) ) whereX _(j) is a subvector of dimensionp _j such that _j=1 ^r p _j =p. We show that the tests, obtained by Dahel (1988), are locally minimax. These tests have been derived to confront H_o: =0 versusH ₁: 0 on the basis of sample of sizeN, X ₁, ..., X_N, drawn fromX andr additional samples of sizeN _j, U _i ^(j) , i=1, ..., N_j, drawn fromX ₍₁₎, ...X _(r) respectively. We assume that the (r+1) samples are independent and thatN _j>p _j forj=0, 1, ..., r (N _oN andp _op). Whenr=2 andp=2, a Monte Carlo study is performed to compare these tests with the likelihood ratio test (LRT) given by Srivastava (1985). We also show that no locally most powerful invariant test exists for this problem.     

Über die Anzahl von Zufallspunkten mit typ-gleichem nächsten Nachbarn und einen multivariaten Zwei-Stichproben-Test

Summary For independents-variate samplesX ₁, ...,X _m i.i.d.f. (.),Y ₁, ...,Y _n i.i.d. g. (.), where the densitiesf (.),g (.) are assumed to be continuous on their respective sets of positivity, consider the numberT _m,n of pointsZ of the pooled sample (which are either of typeX or of typeY) such that the nearest neighbor ofZ is of the same type asZ. We show that, as , independently of (.). An omnibus test for the two sample problem f(.)g(.) orf(.)g(.)? may be obtained by rejecting the hypothesisf(.)g(.) for large values ofT _m,n.     

Rank tests for testing randomness of a regression coefficient in a linear regression model

We propose a class of nonparametric tests for testing non-stochasticity of the regression parameterβ in the regression modely _i =βx _i +ɛ _i ,i=1, ...,n. We prove that the test statistics are asymptotically normally distributed both underH ₀ and under contiguous alternatives. The asymptotic relative efficiencies (in the Pitman sense) with respect to the best parametric test have also been computed and they are quite high. Some simulation studies are carried out to illustrate the results. Research was supported by the University Grants Commission, India.     

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      

Strong uniform convergence for the estimator of the regression function under ϕ-mixing conditions

Suppose the observations (X _i,Y _i), i=1,…, n, are ϕ-mixing. The strong uniform convergence and convergence rate for the estimator of the regression function was studied by serveral authors, e.g. G. Collomb (1984), L. Gy?rfi et al. (1989). But the optimal convergence rates are not reached unless the Y _i are bounded or the E exp (a|Y _i|) are bounded for some a>0. Compared with the i.i.d. case the convergence of the Nadaraya-Watson estimator under ϕ-mixing variables needs strong moment conditions. In this paper we study the strong uniform convergence and convergence rate for the improved kernel estimator of the regression function which has been suggested by Cheng P. (1983). Compared with Theorem A in Y. P. Mack and B. Silverman (1982) or Theorem 3.3.1 in L. Gy?rfi et al. (1989), we prove the convergence for this kind of estimators under weaker moment conditions. The optimal convergence rate for the improved kernel estimator is attained under almost the same conditions of Theorem 3.3.2 in L. Gy?rfi et al. (1989). Received: September 1999