TEST OF FIT FOR THE INVERSE GAUSSIAN AND GAMMA DISTRIBUTIONS UNDER CENSORING

The problem of testing the fit of the inverse Gaussian and the gamma distribution when the sample is censored and some of the parameters are unknown, is studied. Empirical Distribution Function (EDF) statistics, namely Cramér-von Mises' W ² and the Anderson-Darling's A ², are used. The limiting covariance functions of the corresponding empirical processes are derived. Asymptotic percentage points are given for some parameter values and censoring proportions. Moreover, a numerical routine is made available upon request, to obtain p-values for both test statistics, thus eliminating the need of tables and interpolation. Finally, a simple Monte Carlo study is presented to evaluate first, the approximation when using the asymptotic distributions in finite samples and second, to support the use of estimated parameter values instead of the unknown parameters needed in the limiting covariance function.     

Image estimators based on marked bins

The problem of approximating an ‘image’ S?? ^d from a random sample of points is considered. If S is included in a grid of square bins, a plausible estimator of S is defined as the union of the ‘marked’ bins (those containing a sample point). We obtain convergence rates for this estimator and study its performance in the approximation of the border of S. The practical aspects of implementation are discussed, including some technical improvements on the estimator, whose performance is checked through a real data example.     

The Characterization of the Symmetric Lorenz Curves by Doubly Truncated Mean Function

We characterize symmetric Lorenz curves by the relation m(x, μ²/x) = μ (where μ =E(X) and m(x, y) = E(X | x ≤ X ≤ y) is the doubly truncated mean function). We establish that the points of the r.v. which generate the symmetric points on the Lorenz curve are x and μ²/x, and that all the distribution functions defined on the same support which are generators of the symmetric Lorenz curves have the same mean. We obtain the conditions under which doubly truncated distributions generate symmetrical Lorenz curves.     

Detection of a change point with local polynomial fits for the random design case

Regression functions may have a change or discontinuity point in the ν th derivative function at an unknown location. This paper considers a method of estimating the location and the jump size of the change point based on the local polynomial fits with one‐sided kernels when the design points are random. It shows that the estimator of the location of the change point achieves the rate n^?1/(2ν+1) when ν is even. On the other hand, when ν is odd, it converges faster than the rate n^?1/(2ν+1) due to a property of one‐sided kernels. Computer simulation demonstrates the improved performance of the method over the existing ones.     

A clustering method for global optimization based on thekth nearest neighbour

In this paper we describe a stochastic method for global optimization based on a uniform sampling in the search domain. After a reduction of the sample, computing the distance between the remaining points and using the distribution of the kth nearest neighbour enables clusters of points to be built up, hopefully fitting the regions of attraction of significant local optima; from each of these a local search is started. The properties of the method are analysed, and detailed computational results on standard test functions are provided.     

On Properties of Percentile Bootstrap Confidence Intervals for Period Using Periodogram

Periodic functions have many applications in astronomy. They can be used to model the magnitude of light intensity of the period variable stars that their brightness vary with time. Because the data related to the astronomical applications are commonly observed at the time points that are not regularly spaced, the use of the periodogram as a good tool for estimating period is highlighted. Our bootstrap inference about period is based on maximizing the periodogram and consists of percentile two-sided bootstrap confidence intervals construction for the true period. We also obtain their coverage levels theoretically, and discuss the benefit of double-bootstrap confidence intervals for the parameter by which the coverage levels are substantially improved. Precisely, we show that the coverage error of single-bootstrap confidence intervals is of order n ^?1, decreasing to order n ^?2 when applying double-bootstrap methods. The simulation study given here is a numerical assessment of the theoretical work.     

Robustness of weighted L p–depth and L p–median

Summary: L ^p –norm weighted depth functions are introduced and the local and global robustness of these weighted L ^p –depth functions and their induced multivariate medians are investigated via influence function and finite sample breakdown point. To study the global robustness of depth functions, a notion of finite sample breakdown point is introduced. The weighted L ^p –depth functions turn out to have the same low breakdown point as some other popular depth functions. Their influence functions are also unbounded. On the other hand, the weighted L ^p –depth induced medians are globally robust with the highest possible breakdown point for any reasonable estimator. The weighted L ^p –medians are also locally robust with bounded influence functions for suitable weight functions. Unlike other existing depth functions and multivariate medians, the weighted L ^p depth and medians are easy to calculate in high dimensions. The price for this advantage is the lack of affine invariance and equivariance of the weighted L ^p depth and medians, respectively.*The author thanks the referees for their very insightful and constructive comments and suggestions which led to corrections and substantial improvements. Supported in part by NSF Grants DMS-0071976 and DMS-0134628.     

Asymptotic results for empirical and partial-sum processes: A review

Two processes of importance in statistics and probability are the empirical and partial-sum processes. Based on d-dimensional data X₁, … X_a the empirical measure is defined for any A ⊂ R^d by the sample proportion of observations in A. When normalized, F_n yields the empirical process W_n: = n^1/2 (F_n - F), where F denotes the “true” probability measure. To define partial-sum processes, one needs data that are assigned to specified locations (in contrast to the above, where specified unit masses are assigned to random locations). A suitable context for many applications is that of data attached to points of a lattice, say {X_j:j ϵ J^d} where J = {1, 2,…}, for which the partial sums are defined for any A ⊂ R^d by Thus S(A) is the sum of the data contained in A. When normalized, S yields the partial-sum process. This paper provides an overview of asymptotic results for empirical and partial-sum processes, including strong laws and central limit theorems, together with some indications of their inferential implications.     

Computing maximum likelihood estimates from type II doubly censored exponential data

It is well-known that, under Type II double censoring, the maximum likelihood (ML) estimators of the location and scale parameters, θ and δ, of a twoparameter exponential distribution are linear functions of the order statistics. In contrast, when θ is known, theML estimator of δ does not admit a closed form expression. It is shown, however, that theML estimator of the scale parameter exists and is unique. Moreover, it has good large-sample properties. In addition, sharp lower and upper bounds for this estimator are provided, which can serve as starting points for iterative interpolation methods such as regula falsi. Explicit expressions for the expected Fisher information and Cramér-Rao lower bound are also derived. In the Bayesian context, assuming an inverted gamma prior on δ, the uniqueness, boundedness and asymptotics of the highest posterior density estimator of δ can be deduced in a similar way. Finally, an illustrative example is included.     

Integral Identities for Random Variables

Using a general method for deriving identities for random variables, we find a number of new results involving characteristic functions and generating functions. The method is simply to promote a parameter in an integral relation to the status of a random variable and then take expected values of both sides of the equation. Results include formulas for calculating the characteristic functions for x ², √x, 1/x, x ² + x, R ² = x ² + y ², and so forth in terms of integral transforms of the characteristic functions for x and (x, y), and so forth. Generalizations to higher dimensions can be obtained using the same method. Expressions for inverse/fractional moments, E{n!}, and so forth are also presented, demonstrating the method.     

Estimators of location based on Kolmogorov-Smirnov-type statistics

Two classes of estimators of a location parameter ø₀ are proposed, based on a nonnegative functional H₁^* of the pair (D₁^ø_N, G^ø_N), where and where F_N is the sample distribution function. The estimators of the first class are defined as a value of ø minimizing H₁^*; the estimators of the second class are linearized versions of those of the first. The asymptotic distribution of the estimators is derived, and it is shown that the Kolmogorov-Smirnov statistic, the signed linear rank statistics, and the Cramérvon Mises statistics are special cases of such functionals H₁^*;. These estimators are closely related to the estimators of a shift in the two-sample case, proposed and studied by Boulanger in B2 (pp. 271–284).     

Statistical Discrimination Analysis Using the Maximum Function

The maximum of k functions defined on R ⁿ , n ≥ 1, by f _max (x) = max{f ₁ (x),…, f _k (x)}, ? x ? R ⁿ , can have important roles in Statistics, particularly in Classification. Through its relation with the Bayes error, which is the reference error in classification, it can serve to compute numerical bounds for errors in other classification schemes. It can also serve to define the joint L¹-distance between more than two densities, which, in turn, will serve as a useful tool in Classification and Cluster Analyses. It has a vast potential application in digital image processing too. Finally, its versatile role can be seen in several numerical examples, related to the analysis of Fisher's classical iris data in multidimensional spaces.     

Multivariate control chart based on the highest possibility region

The T ² control chart is widely adopted in multivariate statistical process control. However, when dealing with asymmetrical or multimodal distributions using the traditional T ² control chart, some points with relatively high occurrence possibility might be excluded, while some points with relatively low occurrence possibility might be accepted. Motived by the thought of the highest posterior density credible region, we develop a control chart based on the highest possibility region to solve this problem. It is shown that the proposed multivariate control chart will not only meet the false alarm requirement, but also ensure that all the in-control points are with relatively high occurrence possibility. The advantages and effectiveness of the proposed control chart are demonstrated by some numerical examples in the end.     

Uniform asymptotic linearity in a regression parameter of a process based on a rank statistic

For X₁, …, X_N a random sample from a distribution F, let the process S^δ_N(t) be defined as where K²_N = σ^N_i=1(c_i ? c?)² and R x_i, + Δd, is the rank of X_i + Δd_i, among X₁ + Δd₁, …, X_N + Δd_N. The purpose of this note is to prove that, under certain regularity conditions on F and on the constants c_i and d_i, S^Δ_N (t) is asymptotically approximately a linear function of Δ, uniformly in t and in Δ, |Δ| ≤ C. The special case of two samples is 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|.     

Sampling from spatial databases

This paper deals with techniques for obtaining random point samples from spatial databases. We seek random points from a continuous domain (usually ²) which satisfy a spatial predicate that is represented in the database as a collection of polygons. Several applications of spatial sampling (e.g. environmental monitoring, agronomy, forestry, etc) are described. Sampling problems are characterized in terms of two key parameters: coverage (selectivity), and expected stabbing number (overlap). We discuss two fundamental approaches to sampling with spatial predicates, depending on whether we sample first or evaluate the predicate first. The approaches are described in the context of both quadtrees and R-trees, detailing the sample first, acceptance/rejection tree, and partial area tree algorithms. A sequential algorithm, the one-pass spatial reservoir algorithm is also described. The relative performance of the various sampling algorithms is compared and choice of preferred algorithms is suggested. We conclude with a short discussion of possible extensions.     

Robust designs for nearly linear regression

In this paper we seek designs and estimators which are optimal in some sense for multivariate linear regression on cubes and simplexes when the true regression function is unknown. More precisely, we assume that the unknown true regression function is the sum of a linear part plus some contamination orthogonal to the set of all linear functions in the L₂ norm with respect to Lebesgue measure. The contamination is assumed bounded in absolute value and it is shown that the usual designs for multivariate linear regression on cubes and simplices and the usual least squares estimators minimize the supremum over all possible contaminations of the expected mean square error. Additional results for extrapolation and interpolation, among other things, are discussed. For suitable loss functions optimal designs are found to have support on the extreme points of our design space.     

CONFIDENCE INTERVALS UTILIZING PRIOR INFORMATION IN THE BEHRENS–FISHER PROBLEM

Consider two independent random samples of size f + 1 , one from an N (μ₁, σ²₁) distribution and the other from an N (μ₂, σ²₂) distribution, where σ²₁/σ²₂∈ (0, ∞) . The Welch ‘approximate degrees of freedom’ (‘approximate t‐solution’) confidence interval for μ₁?μ₂ is commonly used when it cannot be guaranteed that σ²₁/σ²₂= 1 . Kabaila (2005, Comm. Statist. Theory and Methods 34 , 291–302) multiplied the half‐width of this interval by a positive constant so that the resulting interval, denoted by J₀, has minimum coverage probability 1 ?α. Now suppose that we have uncertain prior information that σ²₁/σ²₂= 1. We consider a broad class of confidence intervals for μ₁?μ₂ with minimum coverage probability 1 ?α. This class includes the interval J₀, which we use as the standard against which other members of will be judged. A confidence interval utilizes the prior information substantially better than J₀ if (expected length of J)/(expected length of J₀) is (a) substantially less than 1 (less than 0.96, say) for σ²₁/σ²₂= 1 , and (b) not too much larger than 1 for all other values of σ²₁/σ²₂ . For a given f, does there exist a confidence interval that satisfies these conditions? We focus on the question of whether condition (a) can be satisfied. For each given f, we compute a lower bound to the minimum over of (expected length of J)/(expected length of J₀) when σ²₁/σ²₂= 1 . For 1 ?α= 0.95 , this lower bound is not substantially less than 1. Thus, there does not exist any confidence interval belonging to that utilizes the prior information substantially better than J₀.     

On Tests of Uniformity for Randomly Distributed Arcs on a Circle

Let n points be independently distributed on a circle. Moving in a counter-clockwise direction, place arcs of length a on the circle with the i^th are starting at the i^th point. We describe three simple tests of the hypothesis of uniformity based on vacancy, on number of spacings and on the length of the maximal spacing. The tests do not require knowledge of the random points. The asymptotic power of these tests is investigated, and it is shown that vacancy-based tests perform best of the three.     

Extension Of Dale's Moment Conditions With Application To The Wright–fisher Model

Dale's necessary and sufficient conditions for an array to contain the joint moments for some probability distribution on the unit simplex in R² are extended to the unit simplex in R ^d . These conditions are then used in a computational method, based on linear programming, to evaluate the stationary distribution for the diffusion approximation of the Wright–Fisher model in population genetics. The computational method uses a characterization of the diffusion through an adjoint relation between the diffusion operator and its stationary distribution. Application of this adjoint relation to a set of functions in the domain of the generator leads to one set of constraints for the linear program involving the moments of the stationary distribution. The extension of Dale's conditions on the moments add another set of linear conditions and the linear program is solved to obtain bounds on numerical quantities of interest. Numerical illustrations are given to illustrate the accuracy of the method.