Lower bounds of the wrap-around -discrepancy and relationships between MLHD and uniform design with a large size

The wrap-around (WD) L₂-discrepancy has been commonly used in experimental designs. In this paper, some lower bounds of the WD L₂-discrepancy for asymmetrical U-type designs are given and the expectation and variance of midpoint Latin hypercube designs (LHD) are also obtained. Relationships between midpoint LHD and uniform designs for symmetrical and asymmetrical cases are discussed in the sense of comparing the lower bound and the expectation of squared wrap-around L₂-discrepancy of U-type designs. Some comparisons between simple random sampling and the lower bounds of U-type designs are given.     

Upper and lower bounds on the variances of linear combinations of the kth records

We describe a method of determining upper bounds on the variances of linear combinations of the kth records values from i.i.d. sequences, expressed in terms of variances of parent distributions. We also present conditions for which the bounds are sharp, and those for which the respective lower ones are equal to zero. A special attention is paid to the case of the kth record spacings, i.e. the differences of consecutive kth record values.     

Lower bound of average centered L2-discrepancy for U-type designs

Uniform designs are widely used in various scientific investigations and industrial applications. By considering all possible level permutation of the factors, a connection between average centered L₂-discrepancy and generalized wordlength pattern for asymmetrical fractional factorial designs is derived. Moreover, we present new lower bounds to the average centered L₂-discrepancy for symmetrical and asymmetrical U-type designs. For illustration of the theoretical results, the lower bounds for symmetrical and asymmetrical U-type designs are tabulated, and numerical results indicate that our lower bounds behave well and can be recommended for use in practice.     

Sharp upper bounds for the expected values of non-extreme order statistics from discrete distributions

We consider the problem of determining sharp upper bounds on the expected values of non-extreme order statistics based on i.i.d. random variables taking on N values at most. We show that the bound problem is equivalent to the problem of establishing the best approximation of the projection of the density function of the respective order statistic based on the standard uniform i.i.d. sample onto the family of non-decreasing functions by arbitrary N  -valued functions in the norm of L²(0,1)$L^2(0,1)$ space. We also present an algorithm converging to the local minima of the approximation problems.     

On the trimmed mean and minimax-variance L-estimation in Kolmogorov neighbourhoods

We consider the properties of the trimmed mean, as regards minimax-variance L-estimation of a location parameter in a Kolmogorov neighbourhood K() of the normal distribution: We first review some results on the search for an L-minimax estimator in this neighbourhood, i.e. a linear combination of order statistics whose maximum variance in K_t() is a minimum in the class of L-estimators. The natural candidate – the L-estimate which is efficient for that member of K_t,() with minimum Fisher information – is known not to be a saddlepoint solution to the minimax problem. We show here that it is not a solution at all. We do this by showing that a smaller maximum variance is attained by an appropriately trimmed mean. We argue that this trimmed mean, as well as being computationally simple – much simpler than the efficient L-estimate referred to above, and simpler than the minimax M- and R-estimators – is at least “nearly” minimax.     

Bounds for L-Statistics from Weakly Dependent Samples of Random Length

ABSTRACT

Sharp bounds on expected values of L-statistics based on a sample of possibly dependent, identically distributed random variables are given in the case when the sample size is a random variable with values in the set {0, 1, 2,…}. The dependence among observations is modeled by copulas and mixing. The bounds are attainable and provide characterizations of some non trivial distributions.     

Estimation of the Jump Size Density in a Mixed Compound Poisson Process

In this paper, we consider a mixed compound Poisson process, that is, a random sum of independent and identically distributed (i.i.d.) random variables where the number of terms is a Poisson process with random intensity. We study nonparametric estimators of the jump density by specific deconvolution methods. Firstly, assuming that the random intensity has exponential distribution with unknown expectation, we propose two types of estimators based on the observation of an i.i.d. sample. Risks bounds and adaptive procedures are provided. Then, with no assumption on the distribution of the random intensity, we propose two non‐parametric estimators of the jump density based on the joint observation of the number of jumps and the random sum of jumps. Risks bounds are provided, leading to unusual rates for one of the two estimators. The methods are implemented and compared via simulations.     

A new look on optimal foldover plans in terms of uniformity criteria

In this paper, we develop a new mechanism for finding the optimal foldover plans (OFPs) which is based on the uniformity criteria measured by Lee discrepancy, wrap-around L₂-discrepancy, and centered L₂-discrepancy. For three-level fractional factorials as the original designs, general foldover plans and combined designs are defined, and lower bounds of these three discrepancies of combined designs under general foldover plans are also obtained, which can be used as benchmarks for searching OFPs. Illustrative examples with a comparison study between the foldover plans under these discrepancies are provided. Our results provide a theoretical justification for OFPs of three-level designs in terms of uniformity criteria.     

Lower Bounds on the Symmetric L 2-Discrepancy and Their Application

The role of uniformity measured by the symmetric L ₂-discrepancy given in Hickernell (1998 Hickernell , F. J. (1998). A generalized discrepancy and quadrature error bound. Math. Computat. 67:299–322.[Crossref], [Web of Science ®] , [Google Scholar]) has been studied in fractional factorial designs. The issue of lower bounds on the symmetric L ₂-discrepancy is crucial in the construction of uniform designs. This article reports some new lower bounds on the symmetric L ₂-discrepancy for symmetric fractional factorials and for a set of asymmetric fractional factorials. It is valuable to use these lower bounds to measure uniformity of given designs.     

L1-distance and classification problem by Bayesian method

In this article we suggest a definition for the notion of L¹-distance that combines probability density functions and prior probabilities. We also obtain the upper and lower bounds for this distance as well as its relation to other measures. Besides, the relationship between the proposed distance and quantities involved in classification problem by Bayesian method will be established. In practice, calculations are performed by Matlab procedures. As an illustration for applications of the obtained results, the article gives here an estimation for the ability to repay bank debt of some companies in Can Tho City, Vietnam.     

A lower bound for the centred L 2-discrepancy on combined designs under the asymmetric factorials

The foldover is a useful technique in the construction of two-level factorial designs for follow-up experiments. To search an optimal foldover plans is an important issue. In this paper, for a set of asymmetric fractional factorials such as the original designs, a lower bound for centred L ₂-discrepancy of combined designs under a general foldover plan is obtained, which can be used as a benchmark for searching optimal foldover plans. All of our results are the extended ones of Ou et al. [Lower bounds of various discrepancies on combined designs, Metrika 74 (2011), pp. 109–119] for symmetric designs to asymmetric designs. Moreover, it also provides a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

Wavelet density estimation for negatively associated stratified size-biased sample

This paper provides upper bounds of wavelet estimations on L^p (1≤p<∞) risk for a density function in Besov spaces based on negatively associated stratified size-biased random samples. It turns out that the classical theorem of Donoho, Johnstone, Kerkyacharian and Picard is completely extended to more general cases. More precisely, we consider the model with multiplication noise and allow the sample negatively associated. Our theory is illustrated with a simulation study.     

A note on the minimum size of an orthogonal array

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.     

Analysis of least squares regression estimates in case of additional errors in the variables

Estimation of a regression function from independent and identical distributed data is considered. The L₂ error with integration with respect to the design measure is used as error criterion. Upper bounds on the L₂ error of least squares regression estimates are presented, which bound the error of the estimate in case that in the sample given to the estimate the values of the independent and the dependent variables are pertubated by some arbitrary procedure. The bounds are applied to analyze regression-based Monte Carlo methods for pricing American options in case of errors in modelling the price process.     

Bounds for the Bayes Error in Classification: A Bayesian Approach Using Discriminant Analysis

We study two of the classical bounds for the Bayes error P _e , Lissack and Fu’s separability bounds and Bhattacharyya’s bounds, in the classification of an observation into one of the two determined distributions, under the hypothesis that the prior probability χ itself has a probability distribution. The effectiveness of this distribution can be measured in terms of the ratio of two mean values. On the other hand, a discriminant analysis-based optimal classification rule allows us to derive the posterior distribution of χ, together with the related posterior bounds of P _e . Research partially supported by NSERC grant A 9249 (Canada). The authors wish to thank two referees, for their very pertinent comments and suggestions, that have helped to improve the quality and the presentation of the paper, and we have, whenever possible, addressed their concerns.     

Comparison of Records and Maxima

We establish best upper bounds on the expected differences of records and sample maxima, and kth records and kth maxima based on sequences of independent random variables with identical continuous distribution and finite variance. The bounds are expressed in terms of the standard deviation units of the parent distribution. We also provide conditions for attaining the bounds.     

Remarks on the L1 distance in statistical data analysis

We propose the L₁ distance between the distribution of a binned data sample and a probability distribution from which it is hypothetically drawn as a statistic for testing agreement between the data and a model. We study the distribution of this distance for N-element samples drawn from k bins of equal probability and derive asymptotic formulae for the mean and dispersion of L₁ in the large-N limit. We argue that the L₁ distance is asymptotically normally distributed, with the mean and dispersion being accurately reproduced by asymptotic formulae even for moderately large values of N and k.     

Refined solution to upper-bound problem for the expectations of order statistics from decreasing density on the average distributions

Rychlik [Metrika 77, 539–557, 2014] described sharp upper negative bounds for the expectations of low-rank order statistics, centered about the population mean and measured in the mean absolute deviation from the mean units, for the i.i.d. sequences with common distribution possessing decreasing density function on the average. The bounds coincide with the negatives of maximal values of complicated functions on the unit interval. Here, we provide more precise solutions to the maximization problems.     

Penalized regression with model‐based penalties

Nonparametric regression techniques such as spline smoothing and local fitting depend implicitly on a parametric model. For instance, the cubic smoothing spline estimate of a regression function ∫ μ based on observations ti, Yi is the minimizer of Σ{Yi ‐ μ(ti)}² + λ∫(μ′′)². Since ∫(μ″)² is zero when μ is a line, the cubic smoothing spline estimate favors the parametric model μ(t) = α_o + α₁t. Here the authors consider replacing ∫(μ″)² with the more general expression ∫(Lμ)² where L is a linear differential operator with possibly nonconstant coefficients. The resulting estimate of μ performs well, particularly if Lμ is small. They present an O(n) algorithm for the computation of μ. This algorithm is applicable to a wide class of L's. They also suggest a method for the estimation of L. They study their estimates via simulation and apply them to several data sets.     

Bounds on Bivariate Distribution Functions with Given Margins and Known Values at Several Points

Let H(x, y) be a continuous bivariate distribution function with known marginal distribution functions F(x) and G(y). Suppose the values of H are given at several points, H(x _i , y _i ) = θ _i , i = 1, 2,…, n. We first discuss conditions for the existence of a distribution satisfying these conditions, and present a procedure for checking if such a distribution exists. We then consider finding lower and upper bounds for such distributions. These bounds may be used to establish bounds on the values of Spearman's ρ and Kendall's τ. For n = 2, we present necessary and sufficient conditions for existence of such a distribution function and derive best-possible upper and lower bounds for H(x, y). As shown by a counter-example, these bounds need not be proper distribution functions, and we find conditions for these bounds to be (proper) distribution functions. We also present some results for the general case, where the values of H(x, y) are known at more than two points. In view of the simplification in notation, our results are presented in terms of copulas, but they may easily be expressed in terms of distribution functions.