Variance-stabilizing and Confidence-stabilizing Transformations for the Normal Correlation Coefficient with Known Variances

Fosdick and Raftery (2012) recently encountered the problem of inference for a bivariate normal correlation coefficient ρ with known variances. We derive a variance-stabilizing transformation y(ρ) analogous to Fisher’s classical z-transformation for the unknown-variance case. Adjusting y for the sample size n produces an improved “confidence-stabilizing” transformation y_n(ρ) that provides more accurate interval estimates for ρ than the known-variance MLE. Interestingly, the z transformation applied to the unknown-but-equal-variance MLE performs well in the known-variance case for smaller values of |ρ|. Both methods are useful for comparing two or more correlation coefficients in the known-variance case.     

GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES

A sufficient condition is proved for geometric decay of the steady-state probabilities in a quasi-birth-and-death process having a countable number of phases in each level. If there is a positive number η and positive vectors x = (x _i) and y = (y _j ) satisfying some equations and inequalities, the steady-state probability π _mi decays geometrically with rate η in the sense π _mi ～ cη ^m x _i as m → ∞. As an example, the result is applied to a two-queue system with shorter queue discipline.     

Testing for linearity in simple regression models

In this paper a new test is introduced which checks the linearity assumption in bivariate regression models. It is based on the idea that the slope through the data points (x_i,y_i) and (x_j,y_j) should be approximately equal to the slope through the data points (x_j,y_j) and (x_k,y_k) for x_i<x_j<x_k under the assumption that the random variable Y is a linear function of the independent variable x. This idea is formalized in a U-statistic on which the test for linearity is based. The test performs well for the considered case of power transformations, which is of high practical relevance.     

Imputation for missing values and corresponding variance estimation

Imputation is commonly used to compensate for missing data in surveys. We consider the general case where the responses on either the variable of interest y or the auxiliary variable x or both may be missing. We use ratio imputation for y when the associated x is observed and different imputations when x is not observed. We obtain design-consistent linearization and jackknife variance estimators under uniform response. We also report the results of a simulation study on the efficiencies of imputed estimators, and relative biases and efficiencies of associated variance estimators.     

Some asymptotic formulas for lattice paths

Denote by ϱ(n,j), ϱ(a,b,j) and w(n,j) the numbers of two-dimensional lattice paths satisfying respectively the following three conditions: (i) The paths have length n and the area under each path is j. (ii) The paths have fixed endpoints (0,0) and (a,b) and the area under each path is j. (iii) The paths have fixed endpoints (0,0) and (n,n), remain in the domain y<x for 0<x<n, and the area under each path is j. In this paper some asymptotic formulas are given for ϱ(n,j) and w(n,j) as n→∞, and for ϱ(a,b,j) as a a→∞ and b→∞. The results obtained provide also some asymptotic formulas for random walks, for Gaussian binomial coefficients and for round-robin tournaments.     

Matching a correlation coefficient by a Gaussian copula

A Gaussian copula is widely used to define correlated random variables. To obtain a prescribed Pearson correlation coefficient of ρ_x between two random variables with given marginal distributions, the correlation coefficient ρ_z between two standard normal variables in the copula must take a specific value which satisfies an integral equation that links ρ_x to ρ_z. In a few cases, this equation has an explicit solution, but in other cases it must be solved numerically. This paper attempts to address this issue. If two continuous random variables are involved, the marginal transformation is approximated by a weighted sum of Hermite polynomials; via Mehler’s formula, a polynomial of ρ_z is derived to approximate the function relationship between ρ_x and ρ_z. If a discrete variable is involved, the marginal transformation is decomposed into piecewise continuous ones, and ρ_x is expressed as a polynomial of ρ_z by Taylor expansion. For a given ρ_x, ρ_z can be efficiently determined by solving a polynomial equation.     

Monotonicity Conditions and Inequality Imputation for Sample-Selection and Non-Response Problems

ABSTRACT

Under a sample selection or non-response problem, where a response variable y is observed only when a condition δ = 1 is met, the identified mean E(y|δ = 1) is not equal to the desired mean E(y). But the monotonicity condition E(y|δ = 1) ≤ E(y|δ = 0) yields an informative bound E(y|δ = 1) ≤ E(y), which is enough for certain inferences. For example, in a majority voting with δ being the vote-turnout, it is enough to know if E(y) > 0.5 or not, for which E(y|δ = 1) > 0.5 is sufficient under the monotonicity. The main question is then whether the monotonicity condition is testable, and if not, when it is plausible. Answering to these queries, when there is a ‘proxy’ variable z related to y but fully observed, we provide a test for the monotonicity; when z is not available, we provide primitive conditions and plausible models for the monotonicity. Going further, when both y and z are binary, bivariate monotonicities of the type P(y, z|δ = 1) ≤ P(y, z|δ = 0) are considered, which can lead to sharper bounds for P(y). As an empirical example, a data set on the 1996 U.S. presidential election is analyzed to see if the Republican candidate could have won had everybody voted, i.e., to see if P(y) > 0.5, where y = 1 is voting for the Republican candidate.     

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.     

Lessons From Quantile Panel Estimation of the Environmental Kuznets Curve

We employ quantile regression fixed effects models to estimate the income-pollution relationship on NO _x (nitrogen oxide) and SO ₂ (sulfur dioxide) using U.S. data. Conditional median results suggest that conditional mean methods provide too optimistic estimates about emissions reduction for NO _x , while the opposite is found for SO ₂. Deleting outlier states reverses the absence of a turning point for SO ₂ in the conditional mean model, while the conditional median model is robust to them. We also document the relationship's sensitivity to including additional covariates for NO _x , and undertake simulations to shed light on some estimation issues of the methods employed.     

High breakdown point robust estimators with missing data

In this paper, we propose a new procedure to estimate the distribution of a variable y when there are missing data. To compensate the presence of missing responses, it is assumed that a covariate vector x is observed and that y and x are related by means of a semi-parametric regression model. Observed residuals are combined with predicted values to estimate the missing response distribution. Once the responses distribution is consistently estimated, we can estimate any parameter defined through a continuous functional T using a plug in procedure. We prove that the proposed estimators have high breakdown point.     

Quadratic reflected BSDEs and related obstacle problems for PDEs

Abstract

In this paper, we study a kind of reflected backward stochastic differential equations (BSDEs) whose generators are of quadratic growth in z and linear growth in y. We first give an estimate of solutions to such reflected BSDEs. Then under the condition that the generators are convex with respect to z, we can obtain a comparison theorem, which implies the uniqueness of solutions for this kind of reflected BSDEs. Besides, the assumption of convexity also leads to a stability property in the spirit of above estimate. We further establish the nonlinear Feynman-Kac formula of the related obstacle problems for partial differential equations (PDEs) in our framework. At last, a numerical example is given to illustrate the applications of our theoretical results, as well as its connection with an optimal stopping time problem.     

Kshirsagar-Type Lower Bounds for Mean Squared Error of Prediction

Let Y be an observable random vector and Z be an unobserved random variable with joint density f(y, z | θ), where θ is an unknown parameter vector. Considering the problem of predicting Z based on Y, we derive Kshirsagar type lower bounds for the mean squared error of any predictor of Z. These bounds do not require the regularity conditions of Bhattacharyya bounds and hence are more widely applicable. Moreover, the new bounds are shown to be sharper than the corresponding Bhattacharyya bounds. The conditions for attaining the new lower bounds are useful for easy derivation of best unbiased predictors, which we illustrate with some examples.     

Final outcome probabilities for SIR epidemic model

Abstract

We consider an SIR stochastic epidemic model in which new infections occur at rate f(x, y), where x and y are, respectively, the number of susceptibles and infectives at the time of infection and f is a positive sequence of real functions. A simple explicit formula for the final size distribution is obtained. Some efficient recursive methods are proved for the exact calculation of this distribution. In addition, we give a Gaussian approximation for the final distribution using a diffusion process approximation.     

Generating correlated random vector involving discrete variables

For the issue of generating correlated random vector containing discrete variables, one major obstacle is to determine a suitable correlation coefficient ρ_z in normal space for a specified correlation coefficient ρ_x. This paper develops a method to solve this problem. First, the double integral evaluated for ρ_x is transformed into independent standard uniform space, then, a Quasi Monte Carlo method is introduced to calculate the double integral. For a given ρ_x, an appropriate ρ_z is determined by a false position method. Compared with existing methodologies, the proposed method is less efficient, but it is relatively easy to implement.     

HITTING LINES and CIRCLES WITH DIFFUSION PROCESSES

For (x(t),y(t)), a diffusion process starting from (x(0),y(0)) = (x,y), the problem of computing the moment generating function of the first passage time T(x, y) to a given subset D of IR²is considered. A particular case of the method of similarity solutions is used. The problems that can be solved explicitly are those for which D is either a straight line or a circle.     

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.     

Within groups analysis of covariance: multiple comparisons at specified design points using a robust measure location when there is curvature

Consider the situation where measurements are taken at two different times and let M_j(x) be some conditional robust measure of location associated with the random variable Y at time j, given that some covariate X=x. The goal is to test H₀: M₁(x)=M₂(x) for each x∈ x₁,?…?, x_K such that the probability of one or more Type I errors is less than α, where x₁,?…?, x_K are K specified values of the covariate. The paper reports simulation results comparing two methods aimed at accomplishing this goal without specifying some parametric form for the regression line. The first method is based on a simple modification of the method in Wilcox [Introduction to robust estimation and hypothesis testing. 3rd ed. San Diego, CA: Academic Press; 2012, Section 11.11.1]. The main result here is that the second method, which has never been studied, can have higher power, sometimes substantially so. Data from the Well Elderly 2 study, which motivated this paper, are used to illustrate that the alternative approach can make a practical difference. Here, the estimate of M_j(x) is based in part on either a 20% trimmed mean or the Harrell–Davis quantile estimator, but in principle the more successful method can be used with any robust location estimator.     

Estimation of the linear-plateau segmented regression model in the presence of measurement error

It is well known that when the true values of the independent variable are unobservable due to measurement error, the least squares estimator for a regression model is biased and inconsistent. When repeated observations on each x_i are taken, consistent estimators for the linear-plateau model can be formed. The repeated observations are required to classify each observation to the appropriate line segment. Two cases of repeated observations are treated in detail. First, when a single value of y_i is observed with the repeated observations of x_i the least squares estimator using the mean of the repeated x_i observations is consistent and asymptotically normal. Second, when repeated observations on the pair (x_i, y_i ) are taken the least squares estimator is inconsistent, but two consistent estimators are proposed: one that consistently estimates the bias of the least squares estimator and adjusts accordingly; the second is the least squares estimator using the mean of the repeated observations on each pair.     

The Recursive Kernel Distribution Function Estimator Based on Negatively and Positively Associated Sequences

Let {X _j , j ≥ 1} be a strictly stationary negatively or positively associated sequence of real valued random variables with unknown distribution function F(x). On the basis of the random variables {X _j , j ≥ 1}, we propose a smooth recursive kernel-type estimate of F(x), and study asymptotic bias, quadratic-mean consistency and asymptotic normality of the recursive kernel-type estimator under suitable conditions.