Recursive estimation of the mode of a multivariate density

Let f be an unknown possibly multimodal density on R^d and let X₁, X₂, … be a sequence of independent random vectors with density f. Several recursive estimates of the mode of f are proposed, and sufficient conditions ensuring their weak and strong consistency are established.     

On uniformly distributed random points in an n-Ball

Consider a set of r+1 independently and identically and uniformly distributed random points X₀, X₁,…,X_r in RⁿThese points determine almost surely via their convex hull a unique r-simplex in R^e This article deals with the exact density of the r-content of this random r-simplex when the points are such that p of them are in the interior and r+l?p of them are on the surface of a unit n-ball. This problem is transformed into a distribution problem connected with multivariate test statistics. Various possible representations of the exact density in the general case, are also pointed out.     

On multivariate variable-kernel density estimates for time series

Let X₁ be a strictly stationary multiple time series with values in R^d and with a common density f. Let X₁,.,.,X_n, be n consecutive observations of X₁. Let k = k_n, be a sequence of positive integers, and let H_ni be the distance from X_i to its kth nearest neighbour among X_j, j i. The multivariate variable-kernel estimate f_n, of f is defined by where K is a given density. The complete convergence of f_n, to f on compact sets is established for time series satisfying a dependence condition (referred to as the strong mixing condition in the locally transitive sense) weaker than the strong mixing condition. Appropriate choices of k are explicitly given. The results apply to autoregressive processes and bilinear time-series models.     

A modified adaptive accept–reject algorithm for univariate densities with bounded support

The need to simulate from a univariate density arises in several settings, particularly in Bayesian analysis. An especially efficient algorithm which can be used to sample from a univariate density, f _X , is the adaptive accept–reject algorithm. To implement the adaptive accept–reject algorithm, the user has to envelope T ° f _X , where T is some transformation such that the density g(x) ∝ T ^?1 (α+β x) is easy to sample from. Successfully enveloping T ° f _X , however, requires that the user identify the number and location of T ° f _X ’s inflection points. This is not always a trivial task. In this paper, we propose an adaptive accept–reject algorithm which relieves the user of precisely identifying the location of T ° f _X ’s inflection points. This new algorithm is shown to be efficient and can be used to sample from any density such that its support is bounded and its log is three-times differentiable.     

Nonparametric estimation of the derivatives of a density by the method of wavelet for mixing sequences

The problem of estimation of the derivative of a probability density f is considered, using wavelet orthogonal bases. We consider an important kind of dependent random variables, the so-called mixing random variables and investigate the precise asymptotic expression for the mean integrated error of the wavelet estimators. We show that the mean integrated error of the proposed estimator attains the same rate as when the observations are independent, under certain week dependence conditions imposed to the {X _i }, defined in {Ω, N, P}.     

Sequential estimation of the mean of NEF-PVF distributions

Let F = {F₀: 0 ϵ Θ} denote the class of natural exponential family of distributions having power variance function, (NEF-PVF). We consider the problem of sequentially estimating the mean μ of F₀ ϵ F, based on i.i.d. observations from F₀. We propose an appropriate sequential estimation procedure under a combined loss of estimation error and sampling cost. We provide expansion for the regret R_a and study its asymptotic properties. We show that R_a = cv²(μ) + o(1) as a → ∞, where c > 0 is a known constant and v(μ) denotes the coefficient of variation of F₀.     

Theory of factorial designs of the parallel flats type. I: the coefficient matrix

Let GF(s) be the finite field with s elements.(Thus, when s=3, the elements of GF(s) are 0, 1 and 2.)Let A(r×n), of rank r, and c_i(i=1,…,f), (r×1), be matrices over GF(s). (Thus, for n=4, r=2, f=2, we could have A=[¹¹¹⁰₀₁₂₁], c₁=[¹₀], c₂=[⁰₂].) Let T_i (i=1,…,f) be the flat in EG(n, s) consisting of the set of all the s^n?r solutions of the equations At=c_i, wheret′=(t₁,…,t_n) is a vector of variables.(Thus, EG(4, 3) consists of the 3⁴=81 points of the form (t₁,t₂,t₃,t₄), where t's take the values 0,1,2 (in GF(3)). The number of solutions of the equations At=c_i is s^n?r, where r=Rank(A), and the set of such solutions is said to form an (n?r)-flat, i.e. a flat of (n?r) dimensions. In our example, both T₁ and T₂ are 2-flats consisting of 3^4?2=9 points each. The flats T₁,T₂,…,T_f are said to be parallel since, clearly, no two of them can have a common point. In the example, the points of T₁ are (1000), (0011), (2022), (0102), (2110), (1121), (2201), (1212) and (0220). Also, T₂ consists of (0002), (2010), (1021), (2101), (1112), (0120), (1200), (0211) and (2222).) Let T be the fractional design for a sⁿ symmetric factorial experiment obtained by taking T₁,T₂,…,T_f together. (Thus, in the example, 3⁴=81 treatments of the 3⁴ factorial experiment correspond one-one with the points of EG(4,3), and T will be the design (i.e. a subset of the 81 treatments) consisting of the 18 points of T₁ and T₂ enumerated above.)In this paper, we lay the foundation of the general theory of such ‘parallel’ types of designs. We define certain functions of A called the alias component matrices, and use these to partition the coefficient matrix X (n×v), occuring in the corresponding linear model, into components X._j(j=0,1,…,g), such that the information matrix X is the direct sum of the X′._jX._j. Here, v is the total number of parameters, which consist of (possibly μ), and a (general) set of (geometric) factorial effects (each carrying (s?1) degrees of freedom as usual). For j≠0, we show that the spectrum of X′._jX._j does not change if we change (in a certain important way) the usual definition of the effects. Assuming that such change has been adopted, we consider the partition of the X._j into the X_ij (i=1,…,f). Furthermore, the X_ij are in turn partitioned into smaller matrices (which we shall here call the) X_ijh. We show that each X_ijh can be factored into a product of 3 matrices J, ζ (not depending on i,j, and h) and Q(j,h,i)where both the Kronecker and ordinary product are used. We introduce a ring R using the additive groups of the rational field and GF(s), and show that the Q(j,h,i) belong to a ring isomorphic to R. When s is a prime number, we show that R is the cyclotomic field. Finally, we show that the study of the X._j and X′._jX._j can be done in a much simpler manner, in terms of certain relatively small sized matrices over R.     

A study on the least squares estimator of multivariate isotonic regression function

Consider the problem of pointwise estimation of f in a multivariate isotonic regression model Z=f(X₁,…,X_d)+ϵ, where Z is the response variable, f is an unknown nonparametric regression function, which is isotonic with respect to each component, and ϵ is the error term. In this article, we investigate the behavior of the least squares estimator of f. We generalize the greatest convex minorant characterization of isotonic regression estimator for the multivariate case and use it to establish the asymptotic distribution of properly normalized version of the estimator. Moreover, we test whether the multivariate isotonic regression function at a fixed point is larger (or smaller) than a specified value or not based on this estimator, and the consistency of the test is established. The practicability of the estimator and the test are shown on simulated and real data as well.     

EMPIRICAL BAYES ESTIMATION WITH NON-IDENTICAL COMPONENTS. CONTINUOUS CASE.

In this paper a variant of the standard empirical Bayes estimation problem is considered where the component problems in the sequence are not identical in that the conditional distribution of the observations may vary with the component problems. Let {(Θ_n, X_n)} be a sequence of independent random vectors where Θ_n? G and, given Θ_n=Θ_n, X_n -P_Θ,m(n) with {m(n)} a sequence of positive integers where m(n)≤m? < ∞ for all n. With P_Θ,m in a continuous exponential family of distributions, asymptotically optimal empirical Bayes procedures are exhibited which depend on uniform approximations of certain functions on compact sets by polynomials in e^Θ. Such approximations have been explicitly calculated in the case of normal and gamma families. In the case of normal families, asymptotically optimal linear empirical Bayes estimators in the class of all linear estimators are derived and shown to have rate O(n^-1/2).     

Identifiability of distributions under competing risks and complementary risks model

Let X₁,X₂,…,X_p be p random variables with cdf's F₁(x),F₂(x),…,F_p(x)respectively. Let U = min(X₁,X₂,…,X_p) and V = max(X₁,X₂,…,X_p).In this paper we study the problem of uniquely determining and estimating the marginal distributions F₁,F₂,…,F_p given the distribution of U or of V.

First the problem of competing and complementary risks are introduced with examples and the corresponding identification problems are considered when the X₁'s are independently distributed and U(V) is identified, as well as the case when U(V) is not identified. The case when the X₁'s are dependent is considered next. Finally the problem of estimation is considered.     

Nonlinear orthogonal series estimates for random design regression

Let (X,Y) be a pair of random variables with supp(X)⊆[0,1] and EY²<∞. Let m be the corresponding regression function. Estimation of m from i.i.d. data is considered. The L₂ error with integration with respect to the design measure μ (i.e., the distribution of X) is used as an error criterion.Estimates are constructed by estimating the coefficients of an orthonormal expansion of the regression function. This orthonormal expansion is done with respect to a family of piecewise polynomials, which are orthonormal in L₂(μ_n), where μ_n denotes the empirical design measure.It is shown that the estimates are weakly and strongly consistent for every distribution of (X,Y). Furthermore, the estimates behave nearly as well as an ideal (but not applicable) estimate constructed by fitting a piecewise polynomial to the data, where the partition of the piecewise polynomial is chosen optimally for the underlying distribution. This implies e.g., that the estimates achieve up to a logarithmic factor the rate n^−2p/(2p+1), if the underlying regression function is piecewise p-smooth, although their definition depends neither on the smoothness nor on the location of the discontinuities of the regression function.     

Simultaneous estimation of ordered parameters

The problem of estimating ordered parameters is encountered in biological, agricultural, reliability and various other experiments. Consider two populations with densities f₁(x₁-ω₁) and f₂(x₂-ω₂) where ω₁#ω₂. The estimation of ω₁,ω₂) with the loss function, the sum of squared errors, is studied. when f_i is the f_i(,_i,,_i ²) density with ,_i known, i=1,2; we obtain a class of minimax estimators. When ω₁ #ω₂ we show some of these estimators are improved by the maximum likelihood estimator. For a general f_i we give sufficient conditions for the minimaxity of the analogue of the Pitman estimator.     

BAYESIAN SMOOTHING WITH OCCASIONAL JUMPS

Consider a sequence of independent random variables X ₁, X ₂,…,X _n observed at n equally spaced time points where X _i has a probability distribution which is known apart from the values of a parameter θ _i ∈ R which may change from observation to observation. We consider the problem of estimating θ = (θ₁, θ₂,…,θ _n ) given the observed values of X ₁, X ₂,…,X _n . The paper proposes a prior distribution for the parameters θ for which sets of parameter values exhibiting no change, or no change apart from a few sudden large changes, or lots of small changes, all have positive prior probability. Markov chain sampling may be used to calculate Bayes estimates of the parameters. We report the results of a Monte Carlo study based on Poisson distributed data which compares the Bayes estimator with estimators obtained using cubic splines and with estimators derived from the Schwarz criterion. We conclude that the Bayes method is preferable in a minimax sense since it never produces the disastrously large errors of the other methods and pays only a modest price for this degree of safety. All three methods are used to smooth mortality rates for oesophageal cancer in Irish males aged 65–69 over the period 1955 through 1994.     

Weak and strong uniform consistency rates of kernel density estimates for randomly censored data

Let X₁,., X_n, be i.i.d. random variables with distribution function F, and let Y₁,.,.,Y_n be i.i.d. with distribution function G. For i = 1, 2,.,., n set δ_i, = 1 if X_i ≤ Y_i, and 0 otherwise, and X_i, = min{X_i, K_i}. A kernel-type density estimate of f, the density function of F w.r.t. Lebesgue measure on the Borel o-field, based on the censored data (δ_i, X_i), i = 1,.,.,n, is considered. Weak and strong uniform consistency properties over the whole real line are studied. Rates of convergence results are established under higher-order differentiability assumption on f. A procedure for relaxing such assumptions is also proposed.     

Bayesian inference on P(X > Y) in bivariate Rayleigh model

In the literature, assuming independence of random variables X and Y, statistical estimation of the stress–strength parameter R = P(X > Y) is intensively investigated. However, in some real applications, the strength variable X could be highly dependent on the stress variable Y. In this paper, unlike the common practice in the literature, we discuss on estimation of the parameter R where more realistically X and Y are dependent random variables distributed as bivariate Rayleigh model. We derive the Bayes estimates and highest posterior density credible intervals of the parameters using suitable priors on the parameters. Because there are not closed forms for the Bayes estimates, we will use an approximation based on Laplace method and a Markov Chain Monte Carlo technique to obtain the Bayes estimate of R and unknown parameters. Finally, simulation studies are conducted in order to evaluate the performances of the proposed estimators and analysis of two data sets are provided.     

The strong uniform convergence of multivariate variable kernel estimates

We show that sup, completely as, where f is a uniformly continuous density on are independent random vectors with common density f, and f_n is the variable kernel estimate Here H_ni is the distance between X_i and its kth nearest neighbour, K is a given density satisfying some regularity conditions, and k is a sequence of integers with the property that log asn     

Nonparametric regression estimation in a null recurrent time series

We derive an asymptotic theory of nonparametric estimation for a time series regression model Z_t=f(X_t)+W_t, where {X_t} and {Z_t} are observed nonstationary processes, and {W_t} is an unobserved stationary process. The class of nonstationary processes allowed for {X_t} is a subclass of the class of null recurrent Markov chains. This subclass contains the random walk, unit root processes and nonlinear processes. The process {W_t} is assumed to be linear and stationary.     

Deux méthodes d'estimation pour les paramètres de processus moyenne mobile spatiaux

We consider moving average processes, {X_s, s ∈ ??}, where ?? is a triangular lattice in the plane R^2. To estimate the parameters of such processes, Adjengue & Moore (1993) have considered likelihood and gaussian pseudo-likelihood methods. We consider here two other methods. The first one is based on the estimation of the correlations and the relation between these correlations and the parameters of the process. The second relies on a linear approximation of the process. The asymptotic properties of the proposed estimators are analyzed and compared. A simulation study allows us to compare the estimators for fixed sample sizes.     

Limiting behavior of randomly weighted averages of symmetric heavy-tailed random variables

In this paper we consider a sequence of independent continuous symmetric random variables X₁, X₂, …, with heavy-tailed distributions. Then we focus on limiting behavior of randomly weighted averages S_n = R⁽ⁿ⁾₁X₁ + ??? + R⁽ⁿ⁾_nX_n, where the random weights R⁽ⁿ⁾₁, …, R_n⁽ⁿ⁾ which are independent of X₁, X₂, …, X_n, are the cuts of (0, 1) by the n ? 1 order statistics from a uniform distribution. Indeed we prove that c_nS_n converges in distribution to a symmetric α-stable random variable with c_n = n^{1 ? 1/α}/Γ^1/α(α + 1).