Poisson approximations in selected metrics by coupling and semigroup methods with applications

Let S_n = X₁ + … + X_n, where X₁,…, X_n are independent Bernoulli random variables. In this paper, we evaluate probability metrics of the Wasserstein type between the distribution of S_n and a Poisson distribution. Our results show that, if E(S_n) = O(1) and if the individual probabilities of success of the X_i's tend uniformly to zero, then the general rate of convergence of the above mentioned metrics to zero is O(∑ⁿ_i = ₁P²_i). We also show that this rate is sharp and discuss applications of these results.     

Two remarks on order statistics

Let X₍₁₎,…,X_(n) be the order statistics of n iid distributed random variables. We prove that (X_(i)) have a certain Markov property for general distributions and secondly that the order statistics have monotone conditional regression dependence. Both properties are well known in the case of continuous distributions.     

Simultaneous confidence bands for expectile functions

Expectile regression, as a general M smoother, is used to capture the tail behaviour of a distribution. Let (X ₁,Y ₁),…,(X _n ,Y _n ) be i.i.d. rvs. Denote by v(x) the unknown τ-expectile regression curve of Y conditional on X, and by v _n (x) its kernel smoothing estimator. In this paper, we prove the strong uniform consistency rate of v _n (x) under general conditions. Moreover, using strong approximations of the empirical process and extreme value theory, we consider the asymptotic maximal deviation sup_0≤x≤1|v _n (x)?v(x)|. According to the asymptotic theory, we construct simultaneous confidence bands around the estimated expectile function. Furthermore, we apply this confidence band to temperature analysis. Taking Berlin and Taipei as an example, we investigate the temperature risk drivers to these two cities.     

The q-Bernstein basis as a q-binomial distribution

The q-Bernstein basis, used in the definition of the q-Bernstein polynomials, is shown to be the probability mass function of a q-binomial distribution. This distribution is defined on a sequence of zero–one Bernoulli trials with probability of failure at any trial increasing geometrically with the number of previous failures. A modification of this model, with the probability of failure at any trial decreasing geometrically with the number of previous failures, leads to a second q-binomial distribution that is also connected to the q-Bernstein polynomials. The q-factorial moments as well as the usual factorial moments of these distributions are derived. Further, the q-Bernstein polynomial B_n(f(t),q;x) is expressed as the expected value of the function f([X_n]_q/[n]_q) of the random variable X_n obeying the q-binomial distribution. Also, using the expression of the q-moments of X_n, an explicit expression of the q-Bernstein polynomial B_n(f_r(t),q;x), for f_r(t) a polynomial, is obtained.     

Prediction in moving average processes

For the stationary invertible moving average process of order one with unknown innovation distribution F, we construct root-n   consistent plug-in estimators of conditional expectations E(h(_Xn+1)|_X1,…,_Xn)$E(h(X_{n+1})|X_1,\dots ,X_n)$. More specifically, we give weak conditions under which such estimators admit Bahadur-type representations, assuming some smoothness of h or of F. For fixed h it suffices that h   is locally of bounded variation and locally Lipschitz in _L2(F)$L_2(F)$, and that the convolution of h and F   is continuously differentiable. A uniform representation for the plug-in estimator of the conditional distribution function P(_Xn+1?·|_X1,…,_Xn)$P(X_{n+1}?·|X_1,\dots ,X_n)$ holds if F has a uniformly continuous density. For a smoothed version of our estimator, the Bahadur representation holds uniformly over each class of functions h that have an appropriate envelope and whose shifts are F-Donsker, assuming some smoothness of F. The proofs use empirical process arguments.     

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

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.     

Prediction based on linear combinations of order statistics and bivariate concomitants in the case of multivariate elliptical distributions

In this paper, by considering a (3n+1) -dimensional random vector (X₀, X^T, Y^T, Z^T)^T having a multivariate elliptical distribution, we derive the exact joint distribution of (X₀, a^TX_(n), b^TY_[n], c^TZ_[n])^T, where a, b, c∈?ⁿ, X_(n)=(X₍₁₎, …, X_(n))^T, X₍₁₎<···<X_(n), is the vector of order statistics arising from X, and Y_[n]=(Y_[1], …, Y_[n])^T and Z_[n]=(Z_[1], …, Z_[n])^T denote the vectors of concomitants corresponding to X_(n) ((Y_[r], Z_[r])^T, for r=1, …, n, is the vector of bivariate concomitants corresponding to X_(r)). We then present an alternate approach for the derivation of the exact joint distribution of (X₀, X_(r), Y_[r], Z_[r])^T, for r=1, …, n. We show that these joint distributions can be expressed as mixtures of four-variate unified skew-elliptical distributions and these mixture forms facilitate the prediction of X_(r), say, based on the concomitants Y_[r] and Z_[r]. Finally, we illustrate the usefulness of our results by a real data.     

On Dependence Properties of Random Minima and Maxima

Let X _(n) and X ₍₁₎ be the largest and smallest order statistics, respectively, of a random sample of fixed size n. Quite generally, X ₍₁₎ and X _(n) are approximately independent for n sufficiently large. In this article, we study the dependence properties of random extremes in terms of their copula, when the sample size has a left-truncated binomial distribution and show that they tend to be more dependent in this case. We also give closed-form formulas for the measures of association Kendall's τ and Spearman's ρ to measure the amount of dependence between two extremes.     

Minimizing the expected sample range

Let X_i be i.i.d. random variables with finite expectations, and θ_i arbitrary constants, i=1,…,n. Y_i=X_i+θ_i. The expected range of the Y's is R_n(θ₁,…,θ_n)=E(maxY_i-minY_i. It is shown that the expected range is minimized if and only if θ₁=?=θ_n. In the case where the X_i are independently and symmetrically distributed around the same constant, but not identically distributed, it is shown that θ₁=?=θ_n are not necessarily the only (θ₁,...,θ_n) minimizing R_n. Some lemmas which are applicable to more general problems of minimizing R_n are also given.     

Limiting distributions of Kolmogorov-Lévy-type statistics under the alternative

Let X_i, 1 ≤ i ≤ n, be independent identically distributed random variables with a common distribution function F, and let G be a smooth distribution function. We derive the limit distribution of □{ρ_α(F_n, G) - _α(F, G)}, where F_n is the empirical distribution function based on X₁,…,X_n and _α is a Kolmogorov-Lévy-type metric between distribution functions. For α ≤ 0 and two distribution functions F and G the metric p_α is given by p_α(F, G) = inf {? ≤ 0: G(x - α?) - ? F(x) ≤ G(x + α?) + ? for all x ?}.     

Characterizations of generalized mixtures of geometric and exponential distributions based on upper record values

Let X _{U (1)} < X _{U (2)} < … < X _{U ( n )} < … be the sequence of the upper record values from a population with common distribution function F. In this paper, we first give a theorem to characterize the generalized mixtures of geometric distribution by the relation between E[(X _{U ( n +1)}–X _{U ( n )})²|X _{U ( n )} = x] and the function of the failure rate of the distribution, for any positive integer n. Secondly, we also use the same relation to characterize the generalized mixtures of exponential distribution. The characterizing relations were motivated by the work of Balakrishnan and Balasubramanian (1995). Received: March 31, 1999; revised version: November 22, 1999     

A note on some negative dependence notions

A random vector X = (X ₁,…,X _n ) is negatively associated if and only if for every pair of partitions X ₁ = (X _π(1),…,X _π(k)), X ₂ = (X _π(k+1),…,X _π(n)) of X , P( X ₁ ? A, X ₂ ? B) ≤ P( X ₁ ? A)P( X ₂ ? B) whenever A and B are open upper sets and π is any permutation of {1,…,n}. In this paper, we develop some of concepts of negative dependence, which are weaker than negative association but stronger than negative orthant dependence by requiring the above inequality to hold only for some upper sets A and B and applying the arguments in Shaked.     

Asymptotic Properties of Random Weighted Empirical Distribution Function

This article studies the asymptotic properties of the random weighted empirical distribution function of independent random variables. Suppose X₁, X₂, ???, X_n is a sequence of independent random variables, and this sequence is not required to be identically distributed. Denote the empirical distribution function of the sequence by F_n(x). Based on the random weighting method and F_n(x), the random weighted empirical distribution function H_n(x) is constructed and the asymptotic properties of H_n are discussed. Under weak conditions, the Glivenko–Cantelli theorem and the central limit theorem for the random weighted empirical distribution function are obtained. The obtained results have also been applied to study the distribution functions of random errors of multiple sensors.     

Distribution of the correlation coefficient for the class of bivariate elliptical models

We consider n pairs of random variables (X₁₁,X₂₁),(X₁₂,X₂₂),… (X_1n,X_2n) having a bivariate elliptically contoured density of the form where θ₁ θ₂ are location parameters and Δ = ((λ_ik)) is a 2 × 2 symmetric positive definite matrix of scale parameters. The exact distribution of the Pearson product-moment correlation coefficient between X₁ and X₂ is obtained. The usual case when a sample of size n is drawn from a bivariate normal population is a special case of the abovementioned model.     

Rate of consistency of one sample tests of location

Let X₁,…,X_n be a sample from a population with continuous distribution function F(x?θ) such that F(x)+F(-x)=1 and 0<F(x)<1, x?R¹. It is shown that the power- function of a monotone test of H: θ=θ₀ against K: θ>θ₀ cannot tend to 1 as θ?θ₀ → ∞ more than n times faster than the tails of F tend to 0. Some standard as well as robust tests are considered with respect to this rate of convergence.     

Revealing the dependence structure between X(1) and X(n)

In this paper we address the dependence structure of the minimum and maximum of n iid random variables X₁,…,X_n by determining their copula. It is then easy to give an alternative proof for their asymptotic independence and to calculate Kendall's τ and Spearman's ρ for (X₍₁₎,X_(n)). This will show that the dependence between the variables is already small for small sample sizes. Finally, it can be shown that 3τ_n⩾ρ_n⩾τ_n>0. Although closed-form expressions are available for τ_n and ρ_n, we cannot compare them directly but have to use the concept of positive likelihood ratio dependence to establish this result.     

Nonparametric statistical procedures for the changepoint problem

Let X₁,…,X_r?1,X_r,X_r+1,…,X_n be independent, continuous random variables such that X_i, i = 1,…,r, has distribution function F(x), and X_i, i = r+1,…,n, has distribution function F(x?Δ), with -∞ <Δ< ∞. When the integer r is unknown, this is refered to as a change point problem with at most one change. The unknown parameter Δ represents the magnitude of the change and r is called the changepoint. In this paper we present a general review discussion of several nonparametric approaches for making inferences about r and Δ.