The inverse gaussian distribution: Some properties and characterizations

This article presents some structural properties of the inverse Gaussian distribution, together with several new characterizations based on constancy of regression of suitable functions on the sum of n independent identically distributed random variables. A decomposition of the statistic λσ (X^?1_i?X^?1) into n - 1 independent chi-squared random variables, each with one degree of freedom, is given when n is of the form 2^r.     

The uniform convergence of the nadaraya-watson regression function estimate

If (X₁,Y₁), …, (X_n,Y_n) is a sequence of independent identically distributed R_d × R-valued random vectors then Nadaraya (1964) and Watson (1964) proposed to estimate the regression function m(x) = ? {Y₁|X₁ = x{ by where K is a known density and {h_n} is a sequence of positive numbers satisfying certain properties. In this paper a variety of conditions are given for the strong convergence to 0 of ess_Xsup|m_n (X)-m(X)| (here X is independent of the data and distributed as X₁). The theorems are valid for all distributions of X₁ and for all sequences {h_n} satisfying h_n → 0 and nh/log n→0.     

Deficiencies of minimum discrepancy estimators

Suppose the multinomial parameters p_r (θ) are functions of a real valued parameter 0, r = 1,2, …, k. A minimum discrepancy (m.d.) estimator θ of θ is defined as one which minimises the discrepancy function D = Σ n_rf(p_r/n_r), for a suitable function f where n_r is the relative frequency in r-th cell, r = 1,2, …, k. All the usual estimators like maximum likelihood (m. l), minimum chi-square (m. c. s.)., etc. are m.d. estimators. All m.d. estimators have the same asymptotic (first order) efficiency. They are compared on the basis of their deficiencies, a concept recently introduced by Hodges and Lehmann [2]. The expression for least deficiency at any θ is derived. It is shown that in general uniformly least deficient estimators do not exist. Necessary and sufficient conditions on p_r (0) for m. t. and m. c. s. estimators to be uniformly least deficient are obtained.     

Estimation bayesienne des effets dans le modele a effets aleatoires de classification double avec interaction

The problem of estimating the effects in a balanced two-way classification with interaction \documentclass{article}\pagestyle{empty}\begin{document}$i = 1, \ldots ,I;j = 1, \ldots ,J;k = 1, \ldots ,K$\end{document} using a random effect model is considered from a Bayesian view point. Posterior distributions of r_i, c_j and t_ij are obtained under the assumptions that r_i, c_j, t_ij and e_ijk are all independently drawn from normal distributions with zero meansand variances \documentclass{article}\pagestyle{empty}\begin{document}$\sigma _r^2 ,\sigma _c^2 ,\sigma _t^2 ,\sigma _e^2$\end{document} respectively. A non informative reference prior is adopted for \documentclass{article}\pagestyle{empty}\begin{document}$\mu ,\sigma _r^2 ,\sigma _c^2 ,\sigma _t^2 ,\sigma _e^2$\end{document}. Various features of thisposterior distribution are obtained. The same features of the psoterior distribution for a fixed effect model are also obtained. A numerical example is given.     

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.     

Further Properties of Frequentist Confidence Intervals in Regression that Utilize Uncertain Prior Information

Consider a linear regression model with n‐dimensional response vector, regression parameter and independent and identically distributed errors. Suppose that the parameter of interest is where a is a specified vector. Define the parameter where c and t are specified. Also suppose that we have uncertain prior information that . Part of our evaluation of a frequentist confidence interval for is the ratio (expected length of this confidence interval)/(expected length of standard confidence interval), which we call the scaled expected length of this interval. We say that a confidence interval for utilizes this uncertain prior information if: (i) the scaled expected length of this interval is substantially less than 1 when ; (ii) the maximum value of the scaled expected length is not too much larger than 1; and (iii) this confidence interval reverts to the standard confidence interval when the data happen to strongly contradict the prior information. Kabaila and Giri (2009) present a new method for finding such a confidence interval. Let denote the least squares estimator of . Also let and . Using computations and new theoretical results, we show that the performance of this confidence interval improves as increases and decreases.     

RELATIONS BETWEEN ERGODICITY AND MEAN DRIFT FOR MARKOV CHAINS1

If {X_n} is an irreducible aperiodic Markov chain on a state apace denote the mean one step change of position, or “drift”, of {X_n} at j. The main result of this note is to show that, when |µ(j)| is bounded, {X_n} admits a stationary distribution {π_j}if and only if for some N > 0 and some state i, lim inf ∑when this holds, the limit infimum is in fact . Many of the known sufficient or necessary criteria for the existence of a stationary distribution can then be derived easily from this and related results.     

A Class of Multivariate Distributions

In this paper we introduce a class of multivariate distributions, known as the generalized Liouville distribution and defined by the functional form (0 ≤x_i < ∞, αi > 0, β_i > 0, q_i > 0). It is shown that such distributions can be used to derive both the Dirichlet distribution and the beta distribution of the second kind.     

Confidence intervals following Box-Cox transformation

What is the interpretation of a confidence interval following estimation of a Box-Cox transformation parameter λ? Several authors have argued that confidence intervals for linear model parameters ψ can be constructed as if λ. were known in advance, rather than estimated, provided the estimand is interpreted conditionally given $\hat \lambda$. If the estimand is defined as $\psi \left( {\hat \lambda } \right)$, a function of the estimated transformation, can the nominal confidence level be regarded as a conditional coverage probability given $\hat \lambda$, where the interval is random and the estimand is fixed? Or should it be regarded as an unconditional probability, where both the interval and the estimand are random? This article investigates these questions via large-n approximations, small- σ approximations, and simulations. It is shown that, when model assumptions are satisfied and n is large, the nominal confidence level closely approximates the conditional coverage probability. When n is small, this conditional approximation is still good for regression models with small error variance. The conditional approximation can be poor for regression models with moderate error variance and single-factor ANOVA models with small to moderate error variance. In these situations the nominal confidence level still provides a good approximation for the unconditional coverage probability. This suggests that, while the estimand may be interpreted conditionally, the confidence level should sometimes be interpreted unconditionally.     

Central Limit Theorems for the Non‐Parametric Estimation of Time‐Changed Lévy Models

Abstract. Let {Z_t}_{t 0} be a Lévy process with Lévy measure ν and let be a random clock, where g is a non‐negative function and is an ergodic diffusion independent of Z. Time‐changed Lévy models of the form are known to incorporate several important stylized features of asset prices, such as leptokurtic distributions and volatility clustering. In this article, we prove central limit theorems for a type of estimators of the integral parameter β(?):=∫?(x)ν(dx), valid when both the sampling frequency and the observation time‐horizon of the process get larger. Our results combine the long‐run ergodic properties of the diffusion process with the short‐term ergodic properties of the Lévy process Z via central limit theorems for martingale differences. The performance of the estimators are illustrated numerically for Normal Inverse Gaussian process Z and a Cox–Ingersoll–Ross process .     

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.     

Central Limit Theorems for Reduced U‐Statistics Under Dependence and Their Usefulness

A reduced ‐statistic is a ‐statistic with its summands drawn from a restricted but balanced set of pairs. In this article, central limit theorems are derived for reduced ‐statistics under ‐mixing, which significantly extends the work of Brown & Kildea in various aspects. It will be shown and illustrated that reduced ‐statistics are quite useful in deriving test statistics in various nonparametric testing problems.     

CERTAIN BOUNDS CONCERNING CHARACTERISTIC FUNCTIONS1

The largest value of the constant c for which holds over the class of random variables X with non-zero mean and finite second moment, is c=π. Let the random variable (r.v.) X with distribution function F(·) have non-zero mean and finite second moment. In studying a certain random walk problem (Daley, 1976) we sought a bound on the characteristic function of the form for some positive constant c. Of course the inequality is non-trivial only provided that . This note establishes that the best possible constant c =π. The wider relevance of the result is we believe that it underlines the use of trigonometric inequalities in bounding the (modulus of a) c.f. (see e.g. the truncation inequalities in §12.4 of Loève (1963)). In the present case the bound thus obtained is the best possible bound, and is better than the bound (2) |1-?(θ)| ≥ |θEX|-θ²EX²\2 obtained by applying the triangular inequality to the relation which follows from a two-fold integration by parts in the defining equation (*). The treatment of the counter-example furnished below may also be of interest. To prove (1) with c=π, recall that sin u > u(1-u/π) (all real u), so Since |E sinθX|-|E sin(-θX)|, the modulus sign required in (1) can be inserted into (4). Observe that since sin u > u for u < 0, it is possible to strengthen (4) to (denoting max(0,x) by x₊) To show that c=π is the best possible constant in (1), assume without loss of generality that EX > 0, and take θ > 0. Then (1) is equivalent to (6) c < θEX²/{EX-|1-?(θ)|/θ} for all θ > 0 and all r.v.s. X with EX > 0 and EX². Consider the r.v. where 0 < x < 1 and 0 < γ < ∞. Then EX=1, EX²=1+γx², From (4) it follows that |1-?(θ)| > 0 for 0 < |θ| <π|EX|/EX² but in fact this positivity holds for 0 < |θ| < 2π|EX|/EX² because by trigonometry and the Cauchy-Schwartz inequality, |1-?(θ)| > |Re(1-?(θ))| = |E(1-cosθX)| = 2|E sin²θX/2| (10) >2(E sinθX/2)² (11) >(|θEX|-θ²EX²/2π)²/2 > 0, the inequality at (11) holding provided that |θEX|-θ²EX²/2π > 0, i.e., that 0 < |θ| < 2π|EX|/EX². The random variable X at (7) with x= 1 shows that the range of positivity of |1-?(θ)| cannot in general be extended. If X is a non-negative r.v. with finite positive mean, then the identity shows that (1-?(θ))/iθEX is the c.f. of a non-negative random variable, and hence (13) |1-?(θ)| < |θEX| (all θ). This argument fans if pr{X < 0}pr{X> 0} > 0, but as a sharper alternative to (14) |1-?(θ)| < |θE|X||, we note (cf. (2) and (3)) first that (15) |1-?(θ)| < |θEX| +θ²EX²/2. For a bound that is more precise for |θ| close to 0, |1-?(θ)|²= (Re(1-?(θ)))²+ (Im?(θ))² <(θ²EX²/2)²+(|θEX| +θ²EX²_-/π)², so (16) |1-?(θ)| <(|θEX| +θ²EX²_-/π) + |θ|³(EX²)²/8|EX|.     

Wavelet Thresholding Estimation in a Poissonian Interactions Model with Application to Genomic Data

This paper deals with the study of dependencies between two given events modelled by point processes. In particular, we focus on the context of DNA to detect favoured or avoided distances between two given motifs along a genome suggesting possible interactions at a molecular level. For this, we naturally introduce a so‐called reproduction function h that allows to quantify the favoured positions of the motifs and that is considered as the intensity of a Poisson process. Our first interest is the estimation of this function h assumed to be well localized. The estimator based on random thresholds achieves an oracle inequality. Then, minimax properties of on Besov balls are established. Some simulations are provided, proving the good practical behaviour of our procedure. Finally, our method is applied to the analysis of the dependence between promoter sites and genes along the genome of the Escherichia coli bacterium.     

Uniform asymptotic linearity of a process based on a signed rank statistic

Consider the process with, cf. (1.2) on page 265 in B1, X₁, …, X_N a sample from a distribution F and, for i = 1, …, N, R${}_{\text{|x}{}_{\text{1}}\text{, - q}{}_{\text{1}}\text{ø|}}$ , the rank of |X₁ - q₁ø| among |X₁ - q₁ø|, …, |X_N - q_Nø|. It is shown that, under certain regularity conditions on F and on the constants p_i and q_i, T^ø_N(t) is asymptotically approximately a linear function of ø uniformly in t and in ø for |ø| ≤ C. The special case where the p_i and the q_i, are independent of i is considered.     

Empirical Likelihood for Compound Poisson Processes

Let {N(t), t > 0} be a Poisson process with rate λ > 0, independent of the independent and identically distributed random variables with mean μ and variance . The stochastic process is then called a compound Poisson process and has a wide range of applications in, for example, physics, mining, finance and risk management. Among these applications, the average number of objects, which is defined to be λμ, is an important quantity. Although many papers have been devoted to the estimation of λμ in the literature, in this paper, we use the well‐known empirical likelihood method to construct confidence intervals. The simulation results show that the empirical likelihood method often outperforms the normal approximation and Edgeworth expansion approaches in terms of coverage probabilities. A real data set concerning coal‐mining disasters is analyzed using these methods.     

An inclusion-consistent solution to the problem of absurd confidence statements: 2. Consistent nonexact-confidence-interval estimation

Two consistent nonexact-confidence-interval estimation methods, both derived from the consistency-equivalence theorem in Plante (1991), are suggested for estimation of problematic parametric functions with no consistent exact solution and for which standard optimal confidence procedures are inadequate or even absurd, i.e., can provide confidence statements with a 95% empty or all-inclusive confidence set. A belt C(·) from a consistent nonexact-belt family, used with two confidence coefficients (γ = inf_θ P_θ [ θ ? C(X)] and γ⁺ = sup_θ P_θ[θ ? C(X)], is shown to provide a consistent nonexact-belt solution for estimating μ₂ -μ₁ in the Behrens-Fisher problem. A rule for consistent behaviour enables any confidence belt to be used consistently by providing each sample point with best upper and lower confidence levels [δ⁺(x) ≥ γ⁺, δ(x) ≤ γ], which give least-conservative consistent confidence statements ranging from practically exact through informative to noninformative. The rule also provides a consistency correction L(x) = δ⁺(x)-δ(X) enabling alternative confidence solutions to be compared on grounds of adequacy; this is demonstrated by comparing consistent conservative sample-point-wise solutions with inconsistent standard solutions for estimating μ₂/μ₁ (Creasy-Fieller-Neyman problem) and $\sqrt {\mu _1^2 + \mu _2^2 }$, a distance-estimation problem closely related to Stein's 1959 example     

Asymptotic results for empirical and partial-sum processes: A review

Two processes of importance in statistics and probability are the empirical and partial-sum processes. Based on d-dimensional data X₁, … X_a the empirical measure is defined for any A ⊂ R^d by the sample proportion of observations in A. When normalized, F_n yields the empirical process W_n: = n^1/2 (F_n - F), where F denotes the “true” probability measure. To define partial-sum processes, one needs data that are assigned to specified locations (in contrast to the above, where specified unit masses are assigned to random locations). A suitable context for many applications is that of data attached to points of a lattice, say {X_j:j ϵ J^d} where J = {1, 2,…}, for which the partial sums are defined for any A ⊂ R^d by Thus S(A) is the sum of the data contained in A. When normalized, S yields the partial-sum process. This paper provides an overview of asymptotic results for empirical and partial-sum processes, including strong laws and central limit theorems, together with some indications of their inferential implications.     

On multivariate variable-kernel density estimates for time series

Let X₁ be a strictly stationary multiple time series with values in R^d and with a common density f. Let X₁,.,.,X_n, be n consecutive observations of X₁. Let k = k_n, be a sequence of positive integers, and let H_ni be the distance from X_i to its kth nearest neighbour among X_j, j i. The multivariate variable-kernel estimate f_n, of f is defined by where K is a given density. The complete convergence of f_n, to f on compact sets is established for time series satisfying a dependence condition (referred to as the strong mixing condition in the locally transitive sense) weaker than the strong mixing condition. Appropriate choices of k are explicitly given. The results apply to autoregressive processes and bilinear time-series models.     

Asymptotic properties of Bayes risk for one-sided tests

Consider a given sequence {T_n} of estimators for a real-valued parameter θ. This paper studies asymptotic properties of restricted Bayes tests of the following form: reject H₀:θ ≤ θ₀ in favour of the alternative θ > θ₀ if T_n ≤ C_n, where the critical point C_n is determined to minimize among all tests of this form the expected probability of error with respect to the prior distribution. Such tests may or may not be fully Bayes tests, and so are called T_n-Bayes. Under fairly broad conditions it is shown that and the T_n-Bayes risk where a_n is the order of the standard error of T_n, - is the prior density, and μ is the median of F, the limit distribution of (T_n – θ)/a_nb(θ). Several examples are given.