On tail parameter estimation in certain point process models

Let μ(ds, dx) denote Poisson random measure with intensity dsG(dx) on (0, ∞) × (0, ∞), for a measure G(dx) with tails varying regularly at ∞. We deal with estimation of index of regular variation α and weight parameter ξ if the point process is observed in certain windows K_n = [0, T_n] × [Y_n, ∞), where Y_n → ∞ as n → ∞. In particular, we look at asymptotic behaviour of the Hill estimator for α. In certain submodels, better estimators are available; they converge at higher speed and have a strong optimality property. This is deduced from the parametric case G(dx) = ξαx^−α−1 dx via a neighbourhood argument in terms of Hellinger distances.     

Slow convergence of the Gibbs sampler

We consider the Gibbs sampler as a tool for generating an absolutely continuous probability measure ≥ on R^d. When an appropriate irreducibility condition is satisfied, the Gibbs Markov chain (X_n;n ≥ 0) converges in total variation to its target distribution ≥. Sufficient conditions for geometric convergence have been given by various authors. Here we illustrate, by means of simple examples, how slow the convergence can be. In particular, we show that given a sequence of positive numbers decreasing to zero, say (b_n;n ≥ 1), one can construct an absolutely continuous probability measure ≥ on R^d which is such that the total variation distance between ≥ and the distribution of X_n, converges to 0 at a rate slower than that of the sequence (b_n;n ≥ 1). This can even be done in such a way that ≥ is the uniform distribution over a bounded connected open subset of R^d. Our results extend to hit-and-run samplers with direction distributions having supports with symmetric gaps.     

Gamma variates of fractional shape as functioials of a homogeneous multidimensional poisson process

If events are scattered in Rⁿ in accordance with a homogeneous Poisson process and if X is the location of the event with minimal [d]l^P norm, then in the case p = n the n^th absolute powers of the coordinates of X form a sample of size n from a gamma distribution with shape parameter 1/n. In an age of parallel computing, this fact may lead to some attractive simulation methods. One possibility is to generate R = [d]X[d] and U = Y/[d]X[d] independently, perhaps by setting U = Y/[d]Y[d] where Y has any p.d.f. which is a function only of ¦Y¦. We consider for example Y having the uniform distribution in an l^P ball.     

Admissible minimax model selection rule

This paper considers the problem of choosing one between the simple model N(0, I_d) and the full model N(0 I_d) based on the observation X from N(θ I_d) where X, θεR^d, 0 is the null vector in R^d and I_d is the d×d identity matrix. It is shown that the selection rule which chooses the full model if |x| > a_o , for some a₀ > 0 and the simple model otherwise is an admissible minimax model selection rule relative to a loss function which takes into account both inaccuracy and complexity.     

Bayes and empirical bayes estimation of the probability that z > x + y

Let X, Y and Z be independent random variables with common unknown distribution F. Using the Dirichlet process prior for F and squared erro loss function, the Bayes and empirical Bayes estimators of the parameters λ(F). the probability that Z > X + Y, are derived. The limiting Bayes estimator of λ(F) under some conditions on the parameter of the process is shown to be asymptotically normal. The aysmptotic optimality of the empirical Bayes estimator of λ(F) is established. When X, Y and Z have support on the positive real line, these results are derived for randomly right censored data. This problem relates to testing whether than used discussed by Hollander and Proshcan (1972) and Chen, Hollander and Langberg (1983).     

Fixed-width sequential confidence interval for the correlation coefficient of a bivariate normal distribution

A sequential confidence interval of fixed width 2d d > 0, is constructed for the correlation coefficient of a bivariate normal distribution. It is shown that the coverage probability is approximately equal to a preassigned number γ, 0 < γ < as d → 0.     

CORRELATIONS AND CHARACTERIZATIONS OF THE UNIFORM DISTRIBUTION

Two characterizations of the uniform distribution on a suitable compact space are proved. These characterizations are applied to a number of particular examples of which the most interesting is the following: if X , Y and Z are independent n-vectors whose components are independent and identically distributed within a vector, then the pairwise independence of the product moment correlation coefficients between X , Y and Z implies that these vectors are normally distributed.     

The function space D([O, ∞)ρ, E)

The Skorokhod topology is extended to the function space D([0, ∞)ρ, E) of functions, from [0, ∞)ρ to a complete separable metric space E, which are “continuous from above with limits from below. Criteria for tightness are developed. The case in which E is a product space is considered, and conditions under which tightness may be proven componentwise are given. Various applications are studied, including a multidimensional version of Donsker's Theorem, and a functional Central Limit Theorem for a multitype Poisson cluster process.     

Generation of multivariate distributions by vertical density representation

Troutt (1991,1993) proposed the idea of the vertical density representation (VDR) based on Box-Millar method. Kotz, Fang and Liang (1997) provided a systematic study on the multivariate vertical density representation (MVDR). Suppose that we want to generate a random vector X[d]Rⁿthat has a density function ?(x). The key point of using the MVDR is to generate the uniform distribution on [D]_?(v) = {x :?(x) = v} for any v > 0 which is the surface in RⁿIn this paper we use the conditional distribution method to generate the uniform distribution on a domain or on some surface and based on it we proposed an alternative version of the MVDR(type 2 MVDR), by which one can transfer the problem of generating a random vector X with given density f to one of generating (X, X_n+i) that follows the uniform distribution on a region in Rⁿ⁺¹defined by ?. Several examples indicate that the proposed method is quite practical.     

On some properties of bivariate weighted distributions

Let X^w and Y^w be weighted random variables arising from the distribution of (X,Y). We explore implications of independence of X and Y on the dependence structure of (X^w, Y^w). We also show that when X and Y are independent and the weight function is symmetric, identical distribution of X^w and Y^w implies that of X and Y. We discuss application of these results to the study of a renewal process.     

Logistic regression with a partially observed covariate

We present results of a Monte Carlo study comparing four methods of estimating the parameters of the logistic model logit (pr (Y = 1 | X, Z)) = α₀ + α ₁ X + α ₂ Z where X and Z are continuous covariates and X is always observed but Z is sometimes missing. The four methods examined are 1) logistic regression using complete cases, 2) logistic regression with filled-in values of Z obtained from the regression of Z on X and Y, 3) logistic regression with filled-in values of Z and random error added, and 4) maximum likelihood estimation assuming the distribution of Z given X and Y is normal. Effects of different percent missing for Z and different missing value mechanisms on the bias and mean absolute deviation of the estimators are examined for data sets of N = 200 and N = 400.     

Rates of convergence for the k-nearest neighbor estimators with smoother regression functions

Let (X, Y  ) be a R^d×R-valued${\mathbb{R}}^d\times \mathbb{R}\mathrm{-}\mathrm{valued}$ random vector. In regression analysis one wants to estimate the regression function m(x)?E(Y|X=x)$m(x)?\mathbf{E}(Y|X=x)$ from a data set. In this paper we consider the rate of convergence for the k-nearest neighbor estimators in case that X   is uniformly distributed on [0,1]^d$[\mathrm{0,1}{]}^d$, Var(Y|X=x)$\mathbf{Var}(Y|X=x)$ is bounded, and m is (p, C)-smooth. It is an open problem whether the optimal rate can be achieved by a k  -nearest neighbor estimator for 1<p≤1.5$1<p\le 1.5$. We solve the problem affirmatively. This is the main result of this paper. Throughout this paper, we assume that the data is independent and identically distributed and as an error criterion we use the expected L₂ error.     

Distributions of certain variables in samples from two-parameter exponential distribution

Cumulative distribution function of the variable Y=(U+c)/(Z/2ν)) is given. Here U and Z are independent random variables, U has the exponential distribution (1.1) with θ=0, σ=1, Z has the distribution χ² (2ν) and c is a real quantity. The variable Y with U and Z given by (2.2) and (2.3) is used for inference about the parametric functions ?=θ?kσ of a two-parameter exponential distribution (1.1) with k or ? known. Special cases of ? or k are: the parameter θ, the Pth quantile Xp, the mean θ+σ and the value of the cumulative distribution function or of the reliability function at given point a. Also one-sided tolerance limits for a two-parameter exponential distribution can be derived from the distribution of the variable Y. The results are also applied to the Pareto distribution.     

Exponential models,brownian motion,and independence

Some examples of steep, reproductive exponential models are considered. These models are shown to possess a τ-parallel foliation in the terminology of Barndorff-Nielsen and Blaesild. The independence of certain functions follows directly from the foliation. Suppose X(t) is a Wiener process with drift where X(t) = W(t) + ct, 0 < t < T. Furthermore let Y = max [X(s), 0 < s < T]. The joint density of Y and X = X(T), the end value, is studied within the framework of an exponential model, and it is shown that Y(Y – X) is independent of X. It is further shown that Y(Y – X) suitably scaled has an exponential distribution. Further examples are considered by randomizing on T.     

Convergence rates for empirical bayes estimators of parameters in multi-parameter exponential families

This paper obtains the convergence rates of the empirical Bayes estimators of parameters in the multi-parameter exponential families. The rates can approximate to 0(n=¹) arbitrarily. The paper presents the multivariate orthogonal polynomials which are continuous on the total space R^p.     

Extension Of Dale's Moment Conditions With Application To The Wright–fisher Model

Dale's necessary and sufficient conditions for an array to contain the joint moments for some probability distribution on the unit simplex in R² are extended to the unit simplex in R ^d . These conditions are then used in a computational method, based on linear programming, to evaluate the stationary distribution for the diffusion approximation of the Wright–Fisher model in population genetics. The computational method uses a characterization of the diffusion through an adjoint relation between the diffusion operator and its stationary distribution. Application of this adjoint relation to a set of functions in the domain of the generator leads to one set of constraints for the linear program involving the moments of the stationary distribution. The extension of Dale's conditions on the moments add another set of linear conditions and the linear program is solved to obtain bounds on numerical quantities of interest. Numerical illustrations are given to illustrate the accuracy of the method.

     

Joint distribution of simultaneous exposures to several carcinogens in a case–control study: sample size determination

Consider a population of individuals who are free of a disease under study, and who are exposed simultaneously at random exposure levels, say X,Y,Z,… to several risk factors which are suspected to cause the disease in the populationm. At any specified levels X=x, Y=y, Z=z, …, the incidence rate of the disease in the population ot risk is given by the exposure–response relationship r(x,y,z,…) = P(disease|x,y,z,…). The present paper examines the relationship between the joint distribution of the exposure variables X,Y,Z, … in the population at risk and the joint distribution of the exposure variables U,V,W,… among cases under the linear and the exponential risk models. It is proven that under the exponential risk model, these two joint distributions belong to the same family of multivariate probability distributions, possibly with different parameters values. For example, if the exposure variables in the population at risk have jointly a multivariate normal distribution, so do the exposure variables among cases; if the former variables have jointly a multinomial distribution, so do the latter. More generally, it is demonstrated that if the joint distribution of the exposure variables in the population at risk belongs to the exponential family of multivariate probability distributions, so does the joint distribution of exposure variables among cases. If the epidemiologist can specify the differnce among the mean exposure levels in the case and control groups which are considered to be clinically or etiologically important in the study, the results of the present paper may be used to make sample size determinations for the case–control study, corresponding to specified protection levels, i.e., size α and 1–β of a statistical test. The multivariate normal, the multinomial, the negative multinomial and Fisher's multivariate logarithmic series exposure distributions are used to illustrate our results.     

Optimal linear combinations using householder transformations

In pattern classification of sampled vector valued random variables it is often essential, due to computational and accuracy considerations, to consider certain measurable transformations of the random variable. These transformations are generally of a dimension-reducing nature. In this paper we consider the class of linear dimension reducing transformations, i.e., the k × n matrices of rank k where k < n and n is the dimension of the range of the sampled vector random variable.

In this connection, we use certain results (Decell and Quirein, 1973), that guarantee, relative to various class separability criteria, the existence of an extremal transformation. These results also guarantee that the extremal transformation can be expressed in the form (I_k∣ Z)U where I_k is the k × k identity matrix and U is an orthogonal n × n matrix. These results actually limit the search for the extremal linear transformation to a search over the obviously smaller class of k × n matrices of the form (I_k ∣Z)U. In this paper these results are refined in the sense that any extremal transformation can be expressed in the form (I_K∣Z)H_p … H₁ where p ≤ min{k, n?k} and H_i is a Householder transformation i=l,…, p, The latter result allows one to construct a sequence of transformations (L_K∣ Z)H₁, (I_K Z)H₂H₁ … such that the values of the class separability criterion evaluated at this sequence is a bounded, monotone sequence of real numbers. The construction of the i-th element of the sequence of transformations requires the solution of an n-dimensional optimization problem. The solution, for various class separability criteria, of the optimization problem will be the subject of later papers. We have conjectured (with supporting theorems and empirical results) that, since the bounded monotone sequence of real class separability values converges to its least upper bound, this least upper bound is an extremal value of the class separability criterion.

Several open questions are stated and the practical implications of the results are discussed.