On bootstrapping the mode in the nonparametric regression model with random design

In the nonparametric regression model with random design and based on i.i.d. pairs of observations (X _i, Y _i), where the regression function m is given by m(x)=?(Y _i|X _i=x), estimation of the location θ (mode) of a unique maximum of m by the location of a maximum of the Nadaraya-Watson kernel estimator for the curve m is considered. In order to obtain asymptotic confidence intervals for θ, the suitably normalized distribution of is bootstrapped in two ways: we present a paired bootstrap (PB) where resampling is done from the empirical distribution of the pairs of observations and a smoothed paired bootstrap (SPB) where the bootstrap variables are generated from a smooth bivariate density based on the pairs of observations. While the PB requires only relatively small computational effort when carried out in practice, it is shown to work only in the case of vanishing asymptotic bias, i.e. of “undersmoothing” when compared to optimal smoothing for mode estimation. On the other hand, the SPB, although causing more intricate computations, is able to capture the correct amount of bias if the pilot estimator for m oversmoothes. Received: May 2000     

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.     

On the upper and lower semicontinuity of the Aumann integral

Let (T,τ,μ) be a finite measure space, X be a Banach space, P be a metric space and let L₁(μ,X) denote the space of equivalence classes of X-valued Bochner integrable functions on (T,τ,μ). We show that if φ:T×P→2^X is a set-valued function such that for each fixed pεP, φ(·,p) has a measurable graph and for each fixed tεT, φ(t,·) is either upper or lower semicontinuous then the Aumann integral of φ, i.e.,∫_Tφ(t,p)dμ(t)= {∫_Tx(t)dμ(t):xεS_φ(p)}, where S_φ(p)= {yεL₁(μ,X):y(t)εφ(t,p)μ−a.e.}, is either upper or lower semicontinuous in the variable p as well. Our results generalize those of Aumann (1965, 1976) who has considered the above problem for X=Rⁿ, and they have useful applications in general equilibrium and game theory.     

Two ge neral classes of search designs for factor screening experiments with factors at three levels

In this paper, we are presenting general classes of factor screening designs for identifying a few important factors from a list of m (≥ 3) factors each at three levels. A design is a subset of 3^m possible runs. The problem of finding designs with small number of runs is considered here. A main effect plan requires at least (2m + 1) runs for estimating the general mean, linear and quadratic effects of m factors. An orthogonal main effect plan requires, in addition, the number of runs as a multiple of 9. For example, when m=5, a main effect plan requires at least 11 runs and an orthogonal main effect plan requires 18 runs. Two general factor screening designs presented here are nonorthogonal designs with (2m− 1) runs. These designs, called search designs permit us to search for and identify at most two important factors out of m factors under the search linear model introduced in Srivastava (1975). For example, when m=5, the two new plans given in this paper have 9 runs, which is a significant improvement over an orthogonal main effect plan with 18 runs in terms of the number of runs and an improvement over a main effect plan with at least 11 runs. We compare these designs, for 4≤m≤ 10, using arithmetic and geometric means of the determinants, traces, and maximum characteristic roots of certain matrices. Two designs D1 and D2 are identical for m=3 and this design is an optimal design in the class of all search designs under the six criteria discussed above. Designs D1 and D2 are also identical for m=4 under some row and column permutations. Consequently, D1 and D2 are equally good for searching and identifying one important factor out of m factors when m=4. The design D1 is marginally better than the design D2 for searching and identifying one important factor out of m factors when m=5, … , 10. The design D1 is marginally better than the D2 for searching and identifying two important factors out of m factors when m=5, 7, 9. The design D2 is somewhat better than the design D1 for m=6, 8. For m=10, D1 is marginally better than D2 w.r.t. the geometric mean and D2 is marginally better than D1 w.r.t. the arithmetic mean of the maximum characteristic roots.     

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.     

Una disuguaglianza riguardante la funzione gamma incompleta

Summary For testing statistical hypotheses are considered: a test _A ² based on addition theorem, as a sum ofm tests related tom indipendent samples, each one of sizen, withg _A degrees of freedom, and a second test _T ² based on the total aggregation of them samples, withg _T degrees of freedom.Respective power functions are compared, under the same probability of the error of the first kind.An existing result is generalized and it is proved that _T ² is always more powerful for any positive integer value ofg _A–g_T.     

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.     

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.     

Beware of averages!

Summary Let X₁,.,., X_m, and Y₁, Y_n, be two independent samples from the same distribution and let X and Y be the means of these samples. What is the maximal value of P(X < Y)?     

One optional observation inflates α by $${100/\sqrt{n}}$$ per cent

For one-sample level α tests ψ _m based on independent observations X ₁, . . . , X _m , we prove an asymptotic formula for the actual level of the test rejecting if at least one of the tests ψ _n , . . . , ψ _n+k would reject. For k = 1 and usual tests at usual levels α, the result is approximately summarized by the title of this paper. Our method of proof, relying on some second order asymptotic statistics as developed by Pfanzagl and Wefelmeyer, might also be useful for proper sequential analysis. A simple and elementary alternative proof is given for k = 1 in the special case of the Gauss test.     

Almost saturatedD-optimal main effect plans and allied results

The theory of unimodular matrices has been applied to deriveD-optimal main effect plans fors ₁ ×s ₂ factorials ins ₁ +s ₂ runs. Plans with highA-efficiency have also been given.     

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.     

Multivariate t and beta distributions associated with the multivariate F distribution

Relationships between F, skew t and beta distributions in the univariate case are in this paper extended in a natural way to the multivariate case. The result is two new distributions: a multivariate t/skew t distribution (on ℜ^m) and a multivariate beta distribution (on (0,1)^m). A special case of the former distribution is a new multivariate symmetric t distribution. The new distributions have a natural relationship to the standard multivariate F distribution (on (ℜ⁺)^m) and many of their properties run in parallel. We look at: joint distributions, mathematically and graphically; marginal and conditional distributions; moments; correlations; local dependence; and some limiting cases. Received: March 2001     

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     

Finite Sample Correction Factors for Panel Cointegration Tests*

In this paper we present finite T mean and variance correction factors and corresponding response surface regressions for the panel cointegration tests presented in Pedroni (1999, 2004) , Westerlund (2005) , Larsson et al. (2001) and Breitung (2005) . For the single equation tests, we consider up to 12 regressors and for the system tests vector autoregression dimensions up to 12 variables. All commonly used specifications for the deterministic components are considered. The sample sizes considered are T ∈ {10,20,30,40,50,60,70,80,90,100,200,500}.     

Increasing failure rate and decreasing reversed hazard rate properties of the minimum and maximum of multivariate distributions with log-concave densities

For a multivariate random vector X = (X ₁,...,X _n ) with a log-concave density function, it is shown that the minimum min{X ₁,...,X _n } has an increasing failure rate, and the maximum max{X ₁,...,X _n } has a decreasing reversed hazard rate. As an immediate consequence, the result of Gupta and Gupta (in Metrika 53:39–49, 2001) on the multivariate normal distribution is obtained. One error in Gupta and Gupta method is also pointed out.      

Suffizienz bei verschiebungsinvarianten Schätzproblemen

Zusammenfassung Es wird gezeigt, daß beim Schätzen eines die Verteilung einer ZufallsgrößeX (mit Dichte) charakterisierenden Lageparameters verschiebungsinvariante FunktionenZ ₁=a ₁(X ₁,...,X _n ),...,Z _m =a _m (X ₁,...,X _n ) dern unabhängigen WiederholungenX ₁,...,X _n vonX genau dann suffizient sind, wenn für jede konvexe Schadensfunktion ein gleichmäßig bestes, nur vonZ ₁,...,Z _m abhängendes verschiebungsinvariantes Schätzverfahren existiert. Weiter wird bewiesen, daßX genau dann normalverteilt ist, wenn zu jeder konvexen Schadensfunktion ein existiert derart, daß ein gleichmäßig bestes verschiebungsinvariantes Schätzverfahren ist.

---

Summary LetX ₁,...,X _n be independent random variables with density functionf(x–) and unknown location parameter R ¹; furthermore leta _i (x ₁,...,x _n ),i=1,..., m, be functions which are invariant with respect to translations. ThenZ _i =a _i (X ₁,...,X _n ),i=1,...,m, are sufficient iff for every convex loss functions (.) there exists a functionh(z ₁,...,z _m ) such thath(Z ₁,...,Z _m ) is a best invariant estimate for the location parameter . Furthermore we show thatX ₁,...,X _n is a sample from a normal distribution if for every convex loss functions (.) there exists a constant such that is a best invariant estimate for .

     

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.     

Een indelingsprobleem

Summary A branch and bound algorithm is given to solve the following problem: To each pair of elements (i,j) from a set X={l,…, n} a number r_ij with r_ij≥ 0, r_ij=r_ij and r_ij= 0 has been assigned. Find a prescribed number of disjoint subsets P₁…,P_m from X, such that Experiments indicate that an optimal solution is usually found in a small number of iterations, but the verification may be rather time consuming. The algorithm may be used to find the minimum value of m for which a partitioning of X with z= 0 exists. The algorithm appears to be efficient for finding this ‘chromatic number of a graph’.