Minimum Hellinger distance estimation in a nonparametric mixture model

In this paper, we investigate the estimation problem of the mixture proportion λ$\lambda$ in a nonparametric mixture model of the form λF(x)+(1-λ)G(x)$\lambda F(x)+(1-\lambda )G(x)$ using the minimum Hellinger distance approach, where F and G are two unknown distributions. We assume that data from the distributions F and G   as well as from the mixture distribution λF+(1-λ)G$\lambda F+(1-\lambda )G$ are available. We construct a minimum Hellinger distance estimator of λ$\lambda$ and study its asymptotic properties. The proposed estimator is chosen to minimize the Hellinger distance between a parametric mixture model and a nonparametric density estimator. We also develop a maximum likelihood estimator of λ$\lambda$. Theoretical properties such as the existence, strong consistency, asymptotic normality and asymptotic efficiency of the proposed estimators are investigated. Robustness properties of the proposed estimator are studied using a Monte Carlo study. Two real data examples are also analyzed.     

Testing of a sub-hypothesis in linear regression models with long memory errors and deterministic design

This paper considers the problem of testing a sub-hypothesis in homoscedastic linear regression models where errors form long memory moving average processes and designs are non-random. Unlike in the random design case, asymptotic null distribution of the likelihood ratio type test based on the Whittle quadratic form is shown to be non-standard and non-chi-square. Moreover, the rate of consistency of the minimum Whittle dispersion estimator of the slope parameter vector is shown to be n^-(1-α)/2$n^{-(1-\alpha )/2}$, different from the rate n^-1/2$n^{-1/2}$ obtained in the random design case, where α$\alpha$ is the rate at which the error spectral density explodes at the origin. The proposed test is shown to be consistent against fixed alternatives and has non-trivial asymptotic power against local alternatives that converge to null hypothesis at the rate n^-(1-α)/2$n^{-(1-\alpha )/2}$.     

Berry–Esseen type bounds for trimmed U-statistics

Trimmed U  -statistics can be constructed in two different ways: by basing the statistic on a trimmed sample or by averaging the trimmed set of kernel values. Mild conditions are given to ensure the rate of convergence to normality is O(n^-1/2)$\mathrm{O}(n^{-1/2})$ in both cases.     

Estimation of the Sobol indices in a linear functional multidimensional model

We consider a functional linear model where the explicative variables are known stochastic processes taking values in a Hilbert space, the main example is given by Gaussian processes in L²([0,1])${\mathbb{L}}^2([0,1])$. We propose estimators of the Sobol indices in this functional linear model. Our estimators are based on U-statistics. We prove the asymptotic normality and the efficiency of our estimators and we compare them from a theoretical and practical point of view with classical estimators of Sobol indices.     

The q-cluster distribution

The paper studies the three-parameter generalization of the logarithmic distribution that is obtained as the cluster distribution for the generalized Euler distribution. The diagnostic statistic, R(x)=_xpx/[(x-1)_px-1]$R(x)={\mathit{xp}}_x/[(x-1)p_{x-1}]$, is constant for the logarithmic distribution. For the new distribution it can decrease, stay constant, or increase as x increases. The relative values of the extra parameters determine the flatness/hollowness of the distribution and its tail behaviour. Kemp's q-logarithmic distribution and the Euler cluster distribution are special cases. Fitted data sets illustrate the properties of the distribution and its limiting forms.     

Some properties of extreme stable laws and related infinitely divisible random variables

In the course of studying the moment sequence {nⁿ:n=0,1,…}$\{n^n:n=0,1,\dots \}$, Eaton et al. [1971. On extreme stable laws and some applications. J. Appl. Probab. 8, 794–801] have shown that this sequence, which is, indeed, the moment sequence of a log-extreme stable law with characteristic exponent γ=1$\gamma =1$, corresponds to a scale mixture of exponential distributions and hence to a distribution with decreasing failure rate. Following essentially the approach of Shanbhag et al. [1977. Some further results in infinite divisibility. Math. Proc. Cambridge Philos. Soc. 82, 289–295] we show that, under certain conditions, log-extreme stable laws with characteristic exponent γ∈[1,2)$\gamma \in [1,2)$ are scale mixtures of exponential distributions and hence are infinitely divisible and have decreasing failure rates. In addition, we study the moment problem associated with the log-extreme stable laws with characteristic exponent γ∈(0,2]$\gamma \in (0,2]$ and throw further light on the existing literature on the subject. As a by-product, we show that generalized Poisson and generalized negative binomial distributions are mixed Poisson distributions. Finally, we address some relevant questions on structural aspects of infinitely divisible distributions, and make new observations, including in particular that certain results appearing in Steutel and van Harn [2004. Infinite Divisibility of Probability Distributions on the Real Line. Marcel Dekker, New York] have links with the Wiener–Hopf factorization met in the theory of random walk.     

Super-simple cyclic designs with small values

Super-simple cyclic designs are useful on constructing codes and designs such as superimposed codes, perfect hash families and optical orthogonal codes with index two. In this paper, we show that there exists a super-simple cyclic (v,4,λ)$(v,4,\lambda )$ for 7?v?41$7?v?41$ and all admissible λ$\lambda$ with two definite exceptions of (v,λ)=(9,3),(13,5)$(v,\lambda )=(9,3),(13,5)$ and one possible exception of (v,λ)=(39,18)$(v,\lambda )=(39,18)$. Some useful algorithms are explained for computer search and new designs are displayed.     

Tools for constructing optimal two-level factorial designs for a linear model containing main effects and one two-factor interaction

In Hedayat and Pesotan [1992, Two-level factorial designs for main effects and selected two-factor interactions. Statist. Sinica 2, 453–464.] the concepts of a g(n,e)$g(n,e)$-design and a g(n,e)$g(n,e)$-matrix are introduced to study designs of n$n$ factor two-level experiments which can unbiasedly estimate the mean, the n$n$ main effects and e$e$ specified two-factor interactions appearing in an orthogonal polynomial model and it is observed that the construction of a g-design is equivalent to the construction of a g  -matrix. This paper deals with the construction of D-optimal g(n,1)$g(n,1)$-matrices. A standard form for a g(n,1)$g(n,1)$-matrix is introduced and some lower and upper bounds on the absolute determinant value of a D-optimal g(n,1)$g(n,1)$-matrix in the class of all g(n,1)$g(n,1)$-matrices are obtained and an approach to construct D-optimal g(n,1)$g(n,1)$-matrices is given for 2?n?8$2?n?8$. For two specific subclasses, namely a certain class of g(n,1)$g(n,1)$-matrices within the class of g(n,1)$g(n,1)$-matrices of index one and the class C(H)$C(H)$ of g(8t+2,1)$g(8t+2,1)$-matrices constructed from a normalized Hadamard matrix H   of order 8t+4(t?1)$8t+4(t?1)$ two techniques for the construction of the restricted D-optimal matrices are given.     

Classification of orthogonal arrays by integer programming

The problem of classifying all isomorphism classes of OA(N,k,s,t)$\mathrm{OA}(N,k,s,t)$'s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot [2002. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94, 71–90; 2003a. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98, 3–21; 2003b. Small covering designs by branch-and-cut. Math. Programming Ser. B 94, 207–220; 2007. Symmetric ILP: coloring and small integers. Discrete Optim., 4, 40–62] for solving integer programming problems with large symmetry groups is used to find all non-isomorphic OA(24,7,2,2)$\mathrm{OA}(24,7,2,2)$'s, OA(24,k,2,3)$\mathrm{OA}(24,k,2,3)$'s for 6?k?11$6?k?11$, OA(32,k,2,3)$\mathrm{OA}(32,k,2,3)$'s for 6?k?11$6?k?11$, OA(40,k,2,3)$\mathrm{OA}(40,k,2,3)$'s for 6?k?10$6?k?10$, OA(48,k,2,3)$\mathrm{OA}(48,k,2,3)$'s for 6?k?8$6?k?8$, OA(56,k,2,3)$\mathrm{OA}(56,k,2,3)$'s, OA(80,k,2,4)$\mathrm{OA}(80,k,2,4)$'s, OA(112,k,2,4)$\mathrm{OA}(112,k,2,4)$'s, for k=6,7$k=6,7$, OA(64,k,2,4)$\mathrm{OA}(64,k,2,4)$'s, OA(96,k,2,4)$\mathrm{OA}(96,k,2,4)$'s for k=7,8$k=7,8$, and OA(144,k,2,4)$\mathrm{OA}(144,k,2,4)$'s for k=8,9$k=8,9$. Further applications to classifying covering arrays with the minimum number of runs and packing arrays with the maximum number of runs are presented.     

On asymptotic properties of the parameter estimator for a type of SPDE

In this paper, we study a random field _U?(t,x)$U_{?}(t,x)$ governed by some type of stochastic partial differential equations with an unknown parameter θ$\theta$ and a small noise ?$?$. We construct an estimator of θ$\theta$ based on the continuous observation of N   Fourier coefficients of _U?(t,x)$U_{?}(t,x)$, and prove the strong convergence and asymptotic normality of the estimator when the noise ?$?$ tends to zero.     

Local asymptotic minimax theory for block-decreasing densities

In this paper, we study Lebesgue densities on (0,∞)^d$(0,\infty {)}^d$ that are non-increasing in each coordinate, while keeping all other coordinates fixed, from the perspective of local asymptotic minimax lower bound theory. In particular, we establish a local optimal rate of convergence of the order n^−1/(d+2)$n^{-1/(d+2)}$.     

Characterizations based on record values and order statistics

Consider a sequence of independent and identically distributed random variables {_Xi,i?1}$\{X_i,i?1\}$ with a common absolutely continuous distribution function F  . Let _X1:n?_X2:n???_Xn:n$X_{1:n}?X_{2:n}???X_{n:n}$ be the order statistics of {_X1,_X2,…,_Xn}$\{X_1,X_2,\dots ,X_n\}$ and {_Yl,l?1}$\{Y_l,l?1\}$ be the sequence of record values generated by {_Xi,i?1}$\{X_i,i?1\}$. In this work, the conditional distribution of _Yl$Y_l$ given _Xn:n$X_{n:n}$ is established. Some characterizations of F   based on record values and _Xn:n$X_{n:n}$ are then given.