Precise large deviations for the difference of two sums of WUOD and non identically distributed random variables with dominatedly varying tails

In this article, we study large deviations for non random difference ∑^n₁(t)_{j = 1}X_1j ? ∑^n₂(t)_{j = 1}X_2j and random difference ∑^N₁(t)_{j = 1}X_1j ? ∑^N₂(t)_{j = 1}X_2j, where {X_1j, j ? 1} is a sequence of widely upper orthant dependent (WUOD) random variables with non identical distributions {F_1j(x), j ? 1}, {X_2j, j ? 1} is a sequence of independent identically distributed random variables, n₁(t) and n₂(t) are two positive integer-valued functions, and {N_i(t), t ? 0}²_{i = 1} with EN_i(t) = λ_i(t) are two counting processes independent of {X_ij, j ? 1}²_{i = 1}. Under several assumptions, some results of precise large deviations for non random difference and random difference are derived, and some corresponding results are extended.     

Randomly weighted sums and their maxima with heavy-tailed increments and dependence structure

Consider the randomly weighted sums S_m(θ) = ∑^m_{i = 1}θ_iX_i, 1 ? m ? n, and their maxima M_n(θ) = max?_{1 ? m ? n}S_m(θ), where X_i, 1 ? i ? n, are real-valued and dependent according to a wide type of dependence structure, and θ_i, 1 ? i ? n, are non negative and arbitrarily dependent, but independent of X_i, 1 ? i ? n. Under some mild conditions on the right tails of the weights θ_i, 1 ? i ? n, we establish some asymptotic equivalence formulas for the tail probabilities of S_n(θ) and M_n(θ) in the case where X_i, 1 ? i ? n, are dominatedly varying, long-tailed and subexponential distributions, respectively.     

ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Consider an ergodic Markov chain X(t) in continuous time with an infinitesimal matrix Q = (q_ij) defined on a finite state space {0, 1,…, N}. In this note, we prove that if X(t) is skip-free positive (negative, respectively), i.e., q_ij, = 0 for j > i+ 1 (i > j+ 1), then the transition probability p_ij(t) = Pr[X(t)=j | X(0) =i] can be represented as a linear combination of p_0N(t) (p^(m)_(N0)(t)), 0 ≤ m ≤N, where f^(m)(t) denotes the mth derivative of a function f(t) with f⁽⁰⁾(t) =f(t). If X(t) is a birth-death process, then p_ij(t) is represented as a linear combination of p_0N^(m)(t), 0 ≤m≤N - |i-j|.     

Almost Sure Convergence of Weighted Sums for Negatively Associated Random Variables

In this article, let {X₁, …, X_n} be a sequence of negatively associated random variables and {a_ni, 1 ? i ? n, n ? 1} be a triangular array of constants. Several almost sure convergence theorems for the weighted sums ∑ⁿ_{i = 1}a_niX_i are established.     

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.     

Convergence properties for weighted sums of NSD random variables

Abstract

Let {X_n, n ? 1} be a sequence of negatively superadditive dependent (NSD, in short) random variables and {b_ni, 1 ? i ? n, n ? 1} be an array of real numbers. In this article, we study the strong law of large numbers for the weighted sums ∑ⁿ_{i = 1}b_niX_i without identical distribution. We present some sufficient conditions to prove the strong law of large numbers. As an application, the Marcinkiewicz-Zygmund strong law of large numbers for NSD random variables is obtained. In addition, the complete convergence for the weighted sums of NSD random variables is established. Our results generalize and improve some corresponding ones for independent random variables and negatively associated random variables.     

Efficient Estimation of a Distribution Function under Quadrant Dependence

LetX₁,X₂, ..., be real-valued random variables forming a strictly stationary sequence, and satisfying the basic requirement of being either pairwise positively quadrant dependent or pairwise negatively quadrant dependent. LetF^ be the marginal distribution function of theX_ips, which is estimated by the empirical distribution functionF_n and also by a smooth kernel-type estimateF_n, by means of the segmentX₁, ...,X_n. These estimates are compared on the basis of their mean squared errors (MSE). The main results of this paper are the following. Under certain regularity conditions, the optimal bandwidth (in the MSE sense) is determined, and is found to be the same as that in the independent identically distributed case. It is also shown thatn MSE(F_n(t)) andnMSE (F^_n(t)) tend to the same constant, asn→∞ so that one can not discriminate be tween the two estimates on the basis of the MSE. Next, ifi(n) = min {k∈{1, 2, ...}; MSE (F_k(t)) ≤ MSE (F_n(t))}, then it is proved thati(n)/n tends to 1, asn→∞. Thus, once again, one can not choose one estimate over the other in terms of their asymptotic relative efficiency. If, however, the squared bias ofF^_n(t) tends to 0 sufficiently fast, or equivalently, the bandwidthh_n satisfies the requirement thatnh³_n→ 0, asn→∞, it is shown that, for a suitable choice of the kernel, (i(n) ?n)/(nh_n) tends to a positive number, asn→∞ It follows that the deficiency ofF_n(t) with respect toF^_n(t),i(n) ?n, is substantial, and, actually, tends to ∞, asn→∞. In terms of deficiency, the smooth estimateF^_n(t) is preferable to the empirical distribution functionF_n(t)     

On the rate of convergence of recursive kernel estimates of probability densities

Recursive estimates f_n^r(x)of the rth derivative f^r(x)(r=0,1)of the univariate probability density f(x) for strictly stationary processes {X_j,} are considered. The asymptotic variance-covariance of f_n^r(x)is established for stationary triangular arrays of random variables satisfying various asymptotic independence-uncorrelatedness conditions.     

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

Moments of suprema of random variables

The supremum of random variables representing a sequence of rewards is of interest in establishing the existence of optimal stopping rules. Necessary and sufficient conditions are given for existence of moments of sup_n(X_n ? c_n) and sup_n(S_n ? c_n) where X₁, X₂, … are i.i.d. random variables, S_n = X₁ + … + X_n, and c_n = (nL(n))^1/r, 0 < r < 2, L = 1, L = log, and L = log log. Following Cohn (1974), “rates of convergence” results are used in the proof.     

Testing independence with additional information

Let X = (X^j : j = 1,…, n) be n row vectors of dimension p independently and identically distributed multinomial. For each j, X^j is partitioned as X^j = (X^j₁, X^j₂, X^j₃), where p_i is the dimension of X^j_i with p₁ = 1,p₁+p₂+p₃ = p. In addition, consider vectors Y^j_i, i = 1,2j = 1,…,n_i that are independent and distributed as X¹_i. We treat here the problem of testing independence between X¹₁ and X¹₃ knowing that X¹₁ and X¹₂ are uncorrected. A locally best invariant test is proposed for this problem.     

Randomly weighted sums of linearly wide quadrant-dependent random variables with heavy tails

This paper investigates tail behavior of the randomly weighted sum ∑ⁿ_{k = 1}θ_kX_k and reaches an asymptotic formula, where X_k, 1 ? k ? n, are real-valued linearly wide quadrant-dependent (LWQD) random variables with a common heavy-tailed distribution, and θ_k, 1 ? k ? n, independent of X_k, 1 ? k ? n, are n non-negative random variables without any dependence assumptions. The LWQD structure includes the linearly negative quadrant-dependent structure, the negatively associated structure, and hence the independence structure. On the other hand, it also includes some positively dependent random variables and some other random variables. The obtained result coincides with the existing ones.     

On the Moments of a Semi-Markovian Random Walk with Gaussian Distribution of Summands

In this article, a semi-Markovian random walk with delay and a discrete interference of chance (X(t)) is considered. It is assumed that the random variables ζ _n , n = 1, 2,…, which describe the discrete interference of chance form an ergodic Markov chain with ergodic distribution which is a gamma distribution with parameters (α, λ). Under this assumption, the asymptotic expansions for the first four moments of the ergodic distribution of the process X(t) are derived, as λ → 0. Moreover, by using the Riemann zeta-function, the coefficients of these asymptotic expansions are expressed by means of numerical characteristics of the summands, when the process considered is a semi-Markovian Gaussian random walk with small drift β.     

Admissible tests for the mean with additional information

Let X be a po-normal random vector with unknown µ and unknown covariance matrix ∑ and let X be partitioned as X = (X^′ ₍₁₎, …, X^′ _(r))′ where X_(j)is a subvector of X with dimension p_jsuch that ∑^r _j=1Pj = P0. Some admissible tests are derived for testing H₀: μ = 0 versus H₁: μ ¦0 based on a sample drawn from the whole vector X of dimension p and r additional samples drawn from X₍₁₎, X₍₂₎, …, X(r) respectively, All (r+1) samples are assumed to be independent. The distribution of some of the tests' statistics involved are also derived.     

Berry–Esseen type bounds in heteroscedastic errors-in-variables model

ABSTRACT

Consider the heteroscedastic partially linear errors-in-variables (EV) model y_i = x_iβ + g(t_i) + ε_i, ξ_i = x_i + μ_i (1 ? i ? n), where ε_i = σ_ie_i are random errors with mean zero, σ²_i = f(u_i), (x_i, t_i, u_i) are non random design points, x_i are observed with measurement errors μ_i. When f( · ) is known, we derive the Berry–Esseen type bounds for estimators of β and g( · ) under {e_i,?1 ? i ? n} is a sequence of stationary α-mixing random variables, when f( · ) is unknown, the Berry–Esseen type bounds for estimators of β, g( · ), and f( · ) are discussed under independent errors.     

Progressively Type-II censored conditionally N-ordered statistics from a unified elliptically contoured copula

Progressively Type-II censored conditionally N-ordered statistics (PCCOS-N) arising from iid random vectors X_i = (X¹_i, X²_i, …, X_i^p), i = 1, 2…, n, were investigated by Bairamov (2006 Bairamov, I. (2006). Progressive Type II censored order statistics for multivariate observations. J. Mult. Anal. 97:797–809.[Crossref], [Web of Science ®] , [Google Scholar]), with respect to the magnitudes of N(X_i), i = 1, 2, …, n, where N( · ) is a p-variate measurable function defined on the support set of X₁ satisfying certain regularity conditions and N(X_i) denotes the lifetime of the random vector X_i, i = 1, …, n. Under the PCCOS-N sampling scheme, n independent units are placed on a life-test and after the ith failure, R_i (i = 1, …, m) of the surviving units are removed at random from the remaining observations. In this article, we consider PCCOS-N arising from a vector with identical as well as non identical dependent components, jointly distributed according to a unified elliptically contoured copula (PCCOSDUECC-N). Results established here contain the previous results as particular cases. Illustrative examples and simulation studies show that PCCOSDUECC-N enables us to analyze the lifetime of several systems, including repairable systems and systems with standby components, more efficiently than PCCOS-N.     

Asymptotic tail behavior of a random sum with conditionally dependent subexponential summands

In this paper, we obtain some results for the asymptotic behavior of the tail probability of a random sum S_τ = ∑^τ_{k = 1}X_k, where the summands X_k, k = 1, 2, …, are conditionally dependent random variables with a common subexponential distribution F, and the random number τ is a non negative integer-valued random variable, independent of {X_k: k ? 1}.     

A predictive approach for the selection of a fixed number of good treatments

This paper offers a predictive approach for the selection of a fixed number (= t) of treatments from k treatments with the goal of controlling for predictive losses. For the ith treatment, independent observations X _ij (j = 1,2,…,n) can be observed where X _ij ’s are normally distributed N(θ _i ; σ ²). The ranked values of θ _i ’s and X _i ’s are θ ₍₁₎ ≤ … ≤ θ _(k) and X _[1] ≤ … ≤ X _[k] and the selected subset S = {[k], [k? 1], … , [k ? t+1]} will be considered. This paper distinguishes between two types of loss functions. A type I loss function associated with a selected subset S is the loss in utility from the selector’s view point and is a function of θ _i with i ? S. A type II loss function associated with S measures the unfairness in the selection from candidates’ viewpoint and is a function of θ _i with i ? S. This paper shows that under mild assumptions on the loss functions S is optimal and provides the necessary formulae for choosing n so that the two types of loss can be controlled individually or simultaneously with a high probability. Predictive bounds for the losses are provided, Numerical examples support the usefulness of the predictive approach over the design of experiment approach.