Asymptotically optimal nonparametric one- and two-way analysis of variance tests for the log linear model under censoring

We considerr ×c populations with failure ratesλ _ij(t) satisfying the condition

Moment consistency of estimators in partially linear models under NA samples

Consider the heteroscedastic regression model Y ^(j)(x _in , t _in ) = t _in β + g(x _in ) + σ _in e ^(j)(x _in ), 1 ≤ j ≤ m, 1 ≤ i ≤ n, where s_in²=f(u_in){\sigma_{in}^{2}=f(u_{in})}, (x _in , t _in , u _in ) are fixed design points, β is an unknown parameter, g(·) and f(·) are unknown functions, and the errors {e ^(j)(x _in )} are mean zero NA random variables. The moment consistency for least-squares estimators and weighted least-squares estimators of β is studied. In addition, the moment consistency for estimators of g(·) and f(·) is investigated.     

Berry–Esseen bounds for density estimates under NA assumption

Let {X _j } be a strictly stationary sequence of negatively associated random variables with the marginal probability density function f(x). The recursive kernel estimators of f(x) are defined by

On characterizations of distributions by regression of adjacent generalized order statistics

Let , r ≥ 1, denote generalized order statistics, with arbitrary parameters , based on distribution function F. In this paper we characterize continuous distributions F by the regression of adjacent generalized order statistics, i.e. where are continuous and increasing functions and ψ is strictly increasing. Further we investigate in detail the case when ψ(x) = x and g is a linear function of the form g(x) = cx + d for some .     

On characterizing discrete distributions via conditional expectations of weak record values

Let (W _n ,n ≥ 0) denote the sequence of weak records from a distribution with support S = { α₀,α₁,...,α _N }. In this paper, we consider regression functions of the form ψ _n (x) = E(h(W _n ) |W _n+1 = x), where h(·) is some strictly increasing function. We show that a single function ψ _n (·) determines F uniquely up to F(α₀). Then we derive an inversion formula which enables us to obtain F from knowledge of ψ _n (·), ψ _n-1(·), h(·) and F(α₀).     

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.     

Local linear M-estimation for spatial processes in fixed-design models

We investigate the local linear M-estimation for regression in a fixed-design model when the errors are from a strongly mixing random field. We establish the weak and strong consistency as well as the asymptotic normality of the local linear M-estimator. The conditions on ρ(·) used in this paper are mild and allow many important special cases such as the least square estimator and the least absolute distance estimator.     

A generalized maximum likelihood characterization of the normal distribution

LetP be a probability measure on ℝ andI _x be the set of alln-dimensional rectangles containingx. If for allx ∈ ℝⁿ and θ ∈ ℝ the inequality holds,P is a normal distributioin with mean 0 or the unit mass at 0. The result generalizes Teicher’s (1961) maximum likelihood characterization of the normal density to a characterization ofN(0, σ²) amongall distributions (including those without density). The m.l. principle used is that of Scholz (1980).     

Minimax estimation of a cumulative distribution function by converting to a parametric problem

Let X = (X ₁,...,X _n ) be a sample from an unknown cumulative distribution function F defined on the real line . The problem of estimating the cumulative distribution function F is considered using a decision theoretic approach. No assumptions are imposed on the unknown function F. A general method of finding a minimax estimator d(t;X) of F under the loss function of a general form is presented. The method of solution is based on converting the nonparametric problem of searching for minimax estimators of a distribution function to the parametric problem of searching for minimax estimators of the probability of success for a binomial distribution. The solution uses also the completeness property of the class of monotone decision procedures in a monotone decision problem. Some special cases of the underlying problem are considered in the situation when the loss function in the nonparametric problem is defined by a weighted squared, LINEX or a weighted absolute error.     

On a simple characterisation of threshold graphs

In their very interesting paper “Set-packing problems and threshold graphs” [1] V. Chvatal and P. L. Hammer have shown that the constraints $$\begin{gathered} \sum\limits_{j = 1}^n {a_{ij} x_j \leqslant 1(i = 1,2, . . . , m)} \hfill \\ x_j \in (0,1)(j = 1,2, . . . , n) \hfill \\ \end{gathered} $$ are equivalent to the only inequality $$\begin{gathered} \sum\limits_{j - 1}^n {c_j x_j \leqslant d} \hfill \\ x_j \in (0,1)(j = 1,2, . . . , n) \hfill \\ \end{gathered} $$ if and only if the intersection graph associated with the matrix (a _ij ) — see § 1 — is a threshold graph i.e. a graph none of whose induced subgraphs are isomorphic to 2K ₂,P ₄,C ₄: As Chvatal and Hammer have shown [1], threshold graphs can be characterised in many different ways; the main result of this paper is to give a new, very simple characterisation which will enable us to test whether a graph is a threshold by a simple inspection of its incidence matrix.     

Contributions to nonparametric generalized failure rate function estimation

For a specified distribution functionG with densityg, and unknown distribution functionF with densityf, the generalized failure rate function (x)=f(x)/gG ^–1 F(x) may be estimated by replacingf andF byf _n and , wheref _n is an empirical density function based on a sample of sizen from the distribution functionF, and . Under regularity conditions we show and, under additional restrictions whereC is a subset ofR and _n. Moreover, asymptotic normality is derived and the Berry-Esséen type bound is shown to be related to a theorem which concerns the sum of i.i.d. random variables. The order boundO(n^–1/2+c _n ^1/2 ) is established under mild conditions, wherec _n is a sequence of positive constants related tof _n and tending to 0 asn.Research was supported in part by the Army, Navy and Air Force under Office of Naval Research contract No. N00014-76-C-0608. AMS 1970 subject classifications. Primary 62G05. Secondary 60F15.     

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.     

Minimal sufficient statistics for the group divisible partially balanced incomplete block design (GD-PBIBD) with interaction under an Eisenhart Model II

Summary In this paper, an Eisenmhart Model II with interaction for a GD-PBIB design withp replicates per cell is considered. Specifically the Model Y_ijl=µ+_i+_j+()_ij+e_ijl is assumed, wherei=1, 2, ...,b; j=1, 2, ...,t andl=0, 1, 2, ...p s _ij wheres _ij=1, if treatmentj appears in blocki, 0, otherwise.If _i, _j, ()_ij ande _ijl are normally and independently distributed, then a minimal sufficient (Vector-valued) statistic for the class of densities for this model is found, together with the distribution of each component in the minimal sufficient statistic. It is also shown that the minimal sufficient statistic for this class densities is not complete. Hence the solution of the problem of finding minimum variance unbiased estimators of the variance components is not straightforward.     

Die messende Prüfung bei Abweichung von der Normalverteilungsannahme

Summary For sampling inspection by variables in the one-sided case (item bad if variablex>a) under the usual assumption of normality with known variance ₂ the operating characteristic is given by , wherep denotes the fraction defective. If instead of a normal distribution ((·–a–)/) there is a distributionF((·–a–)/) whereF is sufficiently regular and normed like , one has the approximative operating characteristic . It is shown that for arbitrarily fixed parametersn andc the function takes the valueL _n,c ⁽⁾ (p) at the pointp _F (p)=1–F(–^–1(p)). Sufficient conditions for a simple behavior of the differencep _F (p)–p are given. In the cases of rectangular and symmetrically truncated normal distribution these conditions are shown to be fulfilled.     

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

Minimax estimation under convex loss when the parameter interval is bounded

In the present paper families of truncated distributions with a Lebesgue density forx=(x ₁,...,x _n ) ε ℝ ⁿ are considered, wheref ₀:ℝ → (0, ∞) is a known continuous function andC _n (ϑ) denotes a normalization constant. The unknown truncation parameterϑ which is assumed to belong to a bounded parameter intervalΘ=[0,d] is to be estimated under a convex loss function. It is studied whether a two point prior and a corresponding Bayes estimator form a saddle point when the parameter interval is sufficiently small.     

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.     

$${\phi_p}$$-optimal designs for a linear log contrast model for experiments with mixtures

A mixture experiment is an experiment in which the k ingredients are nonnegative and subject to the simplex restriction on the (k − 1)-dimensional probability simplex S ^k-1. In this work, an essentially complete class of designs under the Kiefer ordering for a linear log contrast model with a mixture experiment is presented. Based on the completeness result, -optimal designs for all p,−∞ ≤ p ≤ 1 including D- and A-optimal are obtained, where the eigenvalues of the design moment matrix are used. By using the approach presented here, we gain insight on how these -optimal designs behave. Mong-Na Lo Huang was supported in part by the National Science Council of Taiwan, ROC under grant NSC 93-2118-M-110-001.     

Efficient quasi-Monte simulations for pricing high-dimensional path-dependent options

Quasi-Monte Carlo method (QMC) is an efficient technique for numerical integration. QMC provides a lower convergence rate, O(ln ^d n/n), than the standard Monte Carlo (MC), , where n is the number of simulations and d the nominal problem dimension. However, some studies in the literature have claimed that the QMC performs better than the MC method for d < 20/30 because of its dependence on d. Caflisch et al. (J Comput Finance 1(1):27–46, 1997) have proposed to extend the QMC superiority by ANOVA considerations. To this aim, we consider the Asian basket option pricing problem, where d is much higher than 30, by QMC simulation. We investigate the applicability of several path-generation constructions that have been proposed to overtake the dimensional drawback. We employ the principal component analysis, the linear transformation, the Kronecker product approximation and test their performance both in terms of computational cost and accuracy. Finally, we compare the results with those obtained by the standard MC.