COMPARISON OF THREE NON-PARAMETRIC TESTS FOR BIVARIATE INTERCHANGEABILITY1

Given a random sample(X₁, Y₁), …,(X_n, Y_n) from a bivariate (BV) absolutely continuous c.d.f. H (x, y), we consider rank tests for the null hypothesis of interchangeability H₀: H(x, y). Three linear rank test statistics, Wilcoxon (W_N), sum of squared ranks (SSR_N) and Savage (S_N), are described in Section 1. In Section 2, asymptotic relative efficiency (ARE) comparisons of the three types of tests are made for Morgenstern (Plackett, 1965) and Moran (1969)BV alternatives with marginal distributions satisfying G(x) = F(x/θ) for some θ≠ 1. Both gamma and lognormal marginal distributions are used.     

Improvement over variance estimation using auxiliary information in sample surveys

This paper addresses the problem of estimating the population variance S²_y of the study variable y using auxiliary information in sample surveys. We have suggested a class of estimators of the population variance S²_y of the study variable y when the population variance S²_x of the auxiliary variable x is known. Asymptotic expressions of bias and mean squared error (MSE) of the proposed class of estimators have been obtained. Asymptotic optimum estimators in the proposed class of estimators have also been identified along with its MSE formula. A comparison has been provided. We have further provided the double sampling version of the proposed class of estimators. The properties of the double sampling version have been provided under large sample approximation. In addition, we support the present study with aid of a numerical illustration.     

Closure property of consistently varying random variables based on precise large deviation principles

Let X = {X₁, X₂, …} be a sequence of independent but not necessarily identically distributed random variables, and let η be a counting random variable independent of X. Consider randomly stopped sum S_η = ∑^η_{k = 1}X_k and random maximum S_(η) ? max?{S₀, …, S_η}. Assuming that each X_k belongs to the class of consistently varying distributions, on the basis of the well-known precise large deviation principles, we prove that the distributions of S_η and S_(η) belong to the same class under some mild conditions. Our approach is new and the obtained results are further studies of Kizinevi?, Sprindys, and ?iaulys (2016) and Andrulyt?, Manstavi?ius, and ?iaulys (2017).     

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.     

The Uniform Asymptotics of the Overshoot of a Random Walk with Light-Tailed Increments

Let {S _n : n ≥ 0} be a random walk with light-tailed increments and negative drift, and let τ(x) be the first time when the random walk crosses a given level x ≥ 0. Tang (2007 Tang , Q. ( 2007 ). The overshoot of a random walk with negative drift . Statist. Probab. Lett. 77 : 158 – 165 .[Crossref], [Web of Science ®] , [Google Scholar]) obtained the asymptotics of P(S _τ(x) ? x > y, τ(x) < ∞) as x → ∞, which is uniform for y ≥ f(x) for any positive function f(x) → ∞ as x → ∞. In this article, the uniform asymptotics of P(S _τ(x) ? x > y, τ(x) < ∞) as x → ∞, for 0 ≤ y ≤ N for any positive number N will be given. Using the above two results, the uniform asymptotics of P(S _τ(x) ? x > y, τ(x) < ∞) as x → ∞, for y ≥ 0, is presented.     

Sequential experimental design and response optimisation

We consider the situation where one wants to maximise a functionf(θ,x) with respect tox, with θ unknown and estimated from observationsy _k . This may correspond to the case of a regression model, where one observesy _k =f(θ,x _k )+ε _k , with ε _k some random error, or to the Bernoulli case wherey _k ∈{0, 1}, with Pr[y _k =1|θ,x _k |=f(θ,x _k ). Special attention is given to sequences given by , with an estimated value of θ obtained from (x₁, y₁),...,(x _k ,y _k ) andd _k (x) a penalty for poor estimation. Approximately optimal rules are suggested in the linear regression case with a finite horizon, where one wants to maximize ∑ _i=1 ^N w _i f(θ, x _i ) with {w _i } a weighting sequence. Various examples are presented, with a comparison with a Polya urn design and an up-and-down method for a binary response problem.     

ON ASYMPTOTIC OPTIMALITY OF SOME TESTS FOR EXPONENTIAL DISTRIBUTIONS

The probability density function (pdf) of a two parameter exponential distribution is given by f(x; p, s?) =s?^-1 exp {-(x - ρ)/s?} for x≥ρ and 0 elsewhere, where 0 < ρ < ∞ and 0 < s?∞. Suppose we have k independent random samples where the ith sample is drawn from the ith population having the pdf f(x; ρ_i, s?_i), 0 < ρ_i < ∞, 0 < s?_i < s?_i < and f(x; ρ, s?) is as given above. Let X_i1 < X_i2 <… < X_iri denote the first r_i order statistics in a random sample of size n_i, drawn from the ith population with pdf f(x; ρ_i, s?_i), i = 1, 2,…, k. In this paper we show that the well known tests of hypotheses about the parameters ρ_i, s?_i, i = 1, 2,…, k based on the above observations are asymptotically optimal in the sense of Bahadur efficiency. Our results are similar to those for normal distributions.     

Semi-empirical pseudo-likelihood for estimating equations in the presence of missing responses

Consider a semiparametric model which parameterizes only the conditional distribution of Y given X, f(y|x,β), and allows the marginal distribution of X to be completely arbitrary. Under the semiparametric model, we develop semi-empirical pseudo-likelihood inference with estimating equation in the presence of missing responses. We define semi-empirical likelihood pseudo-score estimates for both the model parameter and the parameter in the estimating equation simultaneously. Also, we develop semi-empirical pseudo-likelihood ratio inference for them, respectively. A simulation was conducted to evaluate the finite sample properties of the proposed estimators and semi-empirical pseudo-likelihood approach.     

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.     

A MCMC algorithm to fit a general exchangeable model

Consider the exchangeable Bayesian hierarchical model where observations y_i are independently distributed from sampling densities with unknown means, the means µi, are a random sample from a distribution g, and the parameters of g are assigned a known distribution h. A simple algorithm is presented for summarizing the posterior distribution based on Gibbs sampling and the Metropolis algorithm. The software program Matlab is used to implement the algorithm and provide a graphical output analysis. An binomial example is used to illustrate the flexibility of modeling possible using this algorithm. Methods of model checking and extensions to hierarchical regression modeling are discussed.     

A recipe for bivariate copulas

ABSTRACT

We give conditions on a ? ?1, b ∈ ( ? ∞, ∞), and f and g so that C_{a, b}(x, y) = xy(1 + af(x)g(y))^b is a bivariate copula. Many well-known copulas are of this form, including the Ali–Mikhail–Haq Family, Huang–Kotz Family, Bairamov–Kotz Family, and Bekrizadeh–Parham–Zadkarmi Family. One result is that we produce an algorithm for producing such copulas. Another is a one-parameter family of copulas whose measures of concordance range from 0 to 1.     

Linear representation of M-estimates in linear models

Consider the linear regression model, y_i = x_iβ₀ + e_i, i = l,…,n, and an M-estimate β of β_o obtained by minimizing Σρ(y_i — x_iβ), where ρ is a convex function. Let S_n = ΣX_iX_iX_i and r_n = S_n^½ (β — β₀) — S_n ² Σx_ih(e_i), where, with a suitable choice of h(.), the expression Σ x_ix(e,) provides a linear representation of β. Bahadur (1966) obtained the order of r_n as n→ ∞ when β_o is a one-dimensional location parameter representing the median, and Babu (1989) proved a similar result for the general regression parameter estimated by the LAD (least absolute deviations) method. We obtain the stochastic order of r_n as n → ∞ for a general M-estimate as defined above, which agrees with the results of Bahadur and Babu in the special cases considered by them.     

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.     

Modeling with Mixtures of Linear Regressions

Consider data (x ₁,y ₁),...,(x _n,y _n), where each x _i may be vector valued, and the distribution of y _i given x _i is a mixture of linear regressions. This provides a generalization of mixture models which do not include covariates in the mixture formulation. This mixture of linear regressions formulation has appeared in the computer science literature under the name Hierarchical Mixtures of Experts model.This model has been considered from both frequentist and Bayesian viewpoints. We focus on the Bayesian formulation. Previously, estimation of the mixture of linear regression model has been done through straightforward Gibbs sampling with latent variables. This paper contributes to this field in three major areas. First, we provide a theoretical underpinning to the Bayesian implementation by demonstrating consistency of the posterior distribution. This demonstration is done by extending results in Barron, Schervish and Wasserman (Annals of Statistics 27: 536–561, 1999) on bracketing entropy to the regression setting. Second, we demonstrate through examples that straightforward Gibbs sampling may fail to effectively explore the posterior distribution and provide alternative algorithms that are more accurate. Third, we demonstrate the usefulness of the mixture of linear regressions framework in Bayesian robust regression. The methods described in the paper are applied to two examples.     

Estimation of regression parameters in missing data problems

Let Y be a response variable, possibly multivariate, with a density function f (y|x, v; β) conditional on vectors x and v of covariates and a vector β of unknown parameters. The authors consider the problem of estimating β when the values taken by the covariate vector v are available for all observations while some of those taken by the covariate x are missing at random. They compare the profile estimator to several alternatives, both in terms of bias and standard deviation, when the response and covariates are discrete or continuous.     

A Bivariate Distribution Family with Specified Correlation Coefficient and Given Marginals

For given continuous distribution functions F(x) and G(y) and a Pearson correlation coefficient ρ, an algorithm is provided to construct a sequence of continuous bivariate distributions with marginals equal to F(x) and G(y) and the corresponding correlation coefficient converges to ρ. The algorithm can be easily implemented using S-Plus or R. Applications are given to generate bivariate random variables with marginals including Gamma, Beta, Weibull, and uniform distributions.     

Exponential Family Techniques for the Lognormal Left Tail

Let X be lognormal(μ,σ²) with density f(x); let θ > 0 and define . We study properties of the exponentially tilted density (Esscher transform) f_θ(x) = e^?θxf(x)/L(θ), in particular its moments, its asymptotic form as θ→∞ and asymptotics for the saddlepoint θ(x) determined by . The asymptotic formulas involve the Lambert W function. The established relations are used to provide two different numerical methods for evaluating the left tail probability of the sum of lognormals S_n=X₁+?+X_n: a saddlepoint approximation and an exponential tilting importance sampling estimator. For the latter, we demonstrate logarithmic efficiency. Numerical examples for the cdf F_n(x) and the pdf f_n(x) of S_n are given in a range of values of σ²,n and x motivated by portfolio value‐at‐risk calculations.     

Point and confidence interval estimates for a global maximum via extreme value theory

The aim of this paper is to provide some practical aspects of point and interval estimates of the global maximum of a function using extreme value theory. Consider a real-valued function f:D→? defined on a bounded interval D such that f is either not known analytically or is known analytically but has rather a complicated analytic form. We assume that f possesses a global maximum attained, say, at u*∈D with maximal value x*=max _u  f(u)?f(u*). The problem of seeking the optimum of a function which is more or less unknown to the observer has resulted in the development of a large variety of search techniques. In this paper we use the extreme-value approach as appears in Dekkers et al. [A moment estimator for the index of an extreme-value distribution, Ann. Statist. 17 (1989), pp. 1833–1855] and de Haan [Estimation of the minimum of a function using order statistics, J. Amer. Statist. Assoc. 76 (1981), pp. 467–469]. We impose some Lipschitz conditions on the functions being investigated and through repeated simulation-based samplings, we provide various practical interpretations of the parameters involved as well as point and interval estimates for x*.