Hypotheses testing about the drift parameter in linear stochastic differential equation driven by stable processes

In this paper, we consider the problem of hypotheses testing about the drift parameter \(\theta \) in the process \(\text {d}Y^{\delta }_{t} = \theta \dot{f}(t)Y^{\delta }_{t}\text {d}t + b(t)\text {d}L^{\delta }_{t}\) driven by symmetric \(\delta \)-stable Lévy process \(L^{\delta }_{t}\) with \(\dot{f}(t)\) being the derivative of a known increasing function f(t) and b(t) being known as well. We consider the hypotheses testing \(H_{0}: \theta \le 0\) and \(K_{0}: \theta =0\) against the alternatives \(H_{1}: \theta >0\) and \(K_{1}: \theta \ne 0\), respectively. For these hypotheses, we propose inverse methods, which are motivated by sequential approach, based on the first hitting time of the observed process (or its absolute value) to a pre-specified boundary or two boundaries until some given time. The applicability of these methods is illustrated. For the case \(Y^{\delta }_{0}=0\), we are able to calculate the values of boundaries and finite observed times more directly. We are able to show the consistencies of proposed tests for \(Y^{\delta }_{0}\ge 0\) with \(\delta \in (1,2]\) and for \(Y^{\delta }_{0}=0\) with \(\delta \in (0,2]\) under quite mild conditions.     

Markov Chain Markov Field dynamics: Models and statistics

This study deals with time dynamics of Markov fields defined on a finite set of sites with state space <$>E<$>, focussing on Markov Chain Markov Field (MCMF) evolution. Such a model is characterized by two families of potentials: the instantaneous interaction potentials, and the time delay potentials. Four models are specified: auto-exponential dynamics (<$>E = {\of R}^+<$>), auto-normal dynamics (<$>E = {\of R}<$>), auto-Poissonian dynamics (<$>E = {\of N}<$>) and auto-logistic dynamics ( E qualitative and finite). Sufficient conditions ensuring ergodicity and strong law of large numbers are given by using a Lyapunov criterion of stability, and the conditional pseudo-likelihood statistics are summarized. We discuss the identification procedure of the two Markovian graphs and look for validation tests using martingale central limit theorems. An application to meteorological data illustrates such a modelling.     

Conditional estimation of average on the basis of weighting data

LetF(x,y) be a distribution function of a two dimensional random variable (X,Y). We assume that a distribution functionF _x(x) of the random variableX is known. The variableX will be called an auxiliary variable. Our purpose is estimation of the expected valuem=E(Y) on the basis of two-dimensional simple sample denoted by:U=[(X ₁, Y₁)…(X_n, Y_n)]=[X Y]. LetX=[X ₁…X _n]andY=[Y ₁…Y _n].This sample is drawn from a distribution determined by the functionF(x,y). LetX _(k)be the k-th (k=1, …,n) order statistic determined on the basis of the sampleX. The sampleU is truncated by means of this order statistic into two sub-samples: % MathType!End!2!1! and % MathType!End!2!1!.Let % MathType!End!2!1! and % MathType!End!2!1! be the sample means from the sub-samplesU _k,1 andU _k,2, respectively. The linear combination % MathType!End!2!1! of these means is the conditional estimator of the expected valuem. The coefficients of this linear combination depend on the distribution function of auxiliary variable in the pointx _(k).We can show that this statistic is conditionally as well as unconditionally unbiased estimator of the averagem. The variance of this estimator is derived. The variance of the statistic % MathType!End!2!1! is compared with the variance of the order sample mean. The generalization of the conditional estimation of the mean is considered, too.     

A note on finite-sample efficiencies of estimators for the minimum volume ellipsoid

Among the most well known estimators of multivariate location and scatter is the Minimum Volume Ellipsoid (MVE). Many algorithms have been proposed to compute it. Most of these attempt merely to approximate as close as possible the exact MVE, but some of them led to the definition of new estimators which maintain the properties of robustness and affine equivariance that make the MVE so attractive. Rousseeuw and van Zomeren (1990) used the <$>(p+1)<$>- subset estimator which was modified by Croux and Haesbroeck (1997) to give rise to the averaged <$>(p+1)<$>- subset estimator . This note shows by means of simulations that the averaged <$>(p+1)<$>-subset estimator outperforms the exact estimator as far as finite-sample efficiency is concerned. We also present a new robust estimator for the MVE, closely related to the averaged <$>(p+1)<$>-subset estimator, but yielding a natural ranking of the data.     

Estimation of a normal mean relative to balanced loss functions

LetX ₁,…,X _nbe a random sample from a normal distribution with mean θ and variance σ². The problem is to estimate θ with Zellner's (1994) balanced loss function, % MathType!End!2!1!, where 0<ω<1. It is shown that the sample mean % MathType!End!2!1!, is admissible. More generally, we investigate the admissibility of estimators of the form % MathType!End!2!1! under % MathType!End!2!1!. We also consider the weighted balanced loss function, % MathType!End!2!1!, whereq(θ) is any positive function of θ, and the class of admissible linear estimators is obtained under such loss withq(θ) =e ^θ .     

Formulating robust regression estimation as an optimum allocation problem

The Mallows-type estimator, one of the most reasonable bounded influence estimators, often downweights leverage points regardless of the magnitude of the corresponding residual, and this could imply a loss of efficiency. In this article, we consider whether the efficiency of this bounded influence estimator could be improved by regarding both the robust x -distance and the residual size. We develop a new robust procedure based on the ideas of the Mallows-type estimator and the general robust recipe, where data been cleaned by pulling outliers towards their fitted values. Our basic idea is to formulate the robust estimation as an allocation problem, where the objective function is a Huber-type "loss" function, but the pulling resource is restricted. Using a mathematical programming technique, the pulling resource is optimally allocated to influential points <$>({x}_i, y_i)<$> with respect to residual size and given weights, <$>w({x}_i)<$>. Three previously published approaches are compared to our proposal via simulated experiments. In the case of contaminated data by regression outliers and "good" leverage points, the proposed robust estimator is a reasonable bounded influence estimator concerning both efficiency and norm of bias. In addition, the proposed approach offers the potential to establish constraints for the regression parameters and also may potentially provide insight regarding outlier detection.     

Limit distributions of unbiased estimators in natural exponential families

We obtain the possible limit distributions of unbiased estimators of functions of the parameter of a natural exponential family. The limit distribution depends on <$>j<$>, the order of the first non-zero derivative at the true (but usually unknown) value of the parameter. We show that if <$>j \geq 2<$> then the umvu and the maximum likelihood estimators are not asymptotically equivalent.     

On Bahadur representation for sample quantiles under α-mixing sequence

In this paper, by relaxing the mixing coefficients to α(n) = O(n ^?β), β > 3, we investigate the Bahadur representation of sample quantiles under α-mixing sequence and obtain the rate as ${O(n^{-\frac{1}{2}}(\log\log n\cdot\log n)^{\frac{1}{2}})}$ . Meanwhile, for any δ > 0, by strengthening the mixing coefficients to α(n) = O(n ^?β ), ${\beta > \max\{3+\frac{5}{1+\delta},1+\frac{2}{\delta}\}}$ , we have the rate as ${O(n^{-\frac{3}{4}+\frac{\delta}{4(2+\delta)}}(\log\log n\cdot \log n)^{\frac{1}{2}})}$ . Specifically, if ${\delta=\frac{\sqrt{41}-5}{4}}$ and ${\beta > \frac{\sqrt{41}+7}{2}}$ , then the rate is presented as ${O(n^{-\frac{\sqrt{41}+5}{16}}(\log\log n\cdot \log n)^{\frac{1}{2}})}$ .     

The type I distribution of the ratio of independent “Weibullized” generalized beta-prime variables

In this paper we introduce the distribution of , with c >  0, where X _i , i =  1, 2, are independent generalized beta-prime-distributed random variables, and establish a closed form expression of its density. This distribution has as its limiting case the generalized beta type I distribution recently introduced by Nadarajah and Kotz (2004). Due to the presence of several parameters the density can take a wide variety of shapes.      

An interesting property of the Poisson operating characteristic function

In elementary probability theory, as a result of a limiting process the probabilities of aBi(n, p) binomial distribution are approximated by the probabilities of aPo(np) Poisson distribution. Accordingly, in statistical quality control the binomial operating characteristic function \(\mathcal{L}_{n,c} (p)\) is approximated by the Poisson operating characteristic function \(\mathcal{F}_{n,c} (p)\) . The inequality \(\mathcal{L}_{n + 1,c + 1} (p) > \mathcal{L}_{n,c} (p)\) forp∈(0;1) is evident from the interpretation of \(\mathcal{L}_{n + 1,c + 1} (p)\) , \(\mathcal{L}_{n,c} (p)\) as probabilities of accepting a lot. It is shown that the Poisson approximation \(\mathcal{F}_{n,c} (p)\) preserves this essential feature of the binomial operating characteristic function, i.e. that an analogous inequality holds for the Poisson operating characteristic function, too.     

Equalities between OLSE,BLUE and BLUP in the linear model

We consider equalities between the ordinary least squares estimator ( $\mathrm {OLSE} $ ), the best linear unbiased estimator ( $\mathrm {BLUE} $ ) and the best linear unbiased predictor ( $\mathrm {BLUP} $ ) in the general linear model $\{ \mathbf y , \mathbf X \varvec{\beta }, \mathbf V \}$ extended with the new unobservable future value $ \mathbf y _{*}$ of the response whose expectation is $ \mathbf X _{*}\varvec{\beta }$ . Our aim is to provide some new insight and new proofs for the equalities under consideration. We also collect together various expressions, without rank assumptions, for the $\mathrm {BLUP} $ and provide new results giving upper bounds for the Euclidean norm of the difference between the $\mathrm {BLUP} ( \mathbf y _{*})$ and $\mathrm {BLUE} ( \mathbf X _{*}\varvec{\beta })$ and between the $\mathrm {BLUP} ( \mathbf y _{*})$ and $\mathrm {OLSE} ( \mathbf X _{*}\varvec{\beta })$ . A remark is made on the application to small area estimation.     

Nonparametric estimation of a multivariate multiple regression function

Let (X₁, X₂, Y₁, Y₂) be a four dimensional random variable having the joint probability density function f(x₁, x₂, y₁, y₂). In this paper we consider the problem of estimating the regression function \({{E[(_{Y_2 }^{Y_1 } )} \mathord{\left/ {\vphantom {{E[(_{Y_2 }^{Y_1 } )} {_{X_2 = X_2 }^{X_1 = X_1 } }}} \right. \kern-0em} {_{X_2 = X_2 }^{X_1 = X_1 } }}]\) on the basis of a random sample of size n. We have proved that under certain regularity conditions the kernel estimate of this regression function is uniformly strongly consistent. We have also shown that under certain conditions the estimate is asymptotically normally distributed.     

New bootstrap confidence intervals for means of positively skewed distributions

ABSTRACT

In this paper, we consider the problem of constructing non parametric confidence intervals for the mean of a positively skewed distribution. We suggest calibrated, smoothed bootstrap upper and lower percentile confidence intervals. For the theoretical properties, we show that the proposed one-sided confidence intervals have coverage probability α + O(n^{? 3/2}). This is an improvement upon the traditional bootstrap confidence intervals in terms of coverage probability. A version smoothed approach is also considered for constructing a two-sided confidence interval and its theoretical properties are also studied. A simulation study is performed to illustrate the performance of our confidence interval methods. We then apply the methods to a real data set.     

On the central limit theorem along subsequences of sums of i.i.d. random variables

Let \(\mathbb{N } = \{1, 2, 3, \ldots \}\) . Let \(\{X, X_{n}; n \in \mathbb N \}\) be a sequence of i.i.d. random variables, and let \(S_{n} = \sum _{i=1}^{n}X_{i}, n \in \mathbb N \) . Then \( S_{n}/\sqrt{n} \Rightarrow N(0, \sigma ^{2})\) for some \(\sigma ^{2} < \infty \) whenever, for a subsequence \(\{n_{k}; k \in \mathbb N \}\) of \(\mathbb N \) , \( S_{n_{k}}/\sqrt{n_{k}} \Rightarrow N(0, \sigma ^{2})\) . Motivated by this result, we study the central limit theorem along subsequences of sums of i.i.d. random variables when \(\{\sqrt{n}; n \in \mathbb N \}\) is replaced by \(\{\sqrt{na_{n}};n \in \mathbb N \}\) with \(\lim _{n \rightarrow \infty } a_{n} = \infty \) . We show that, for given positive nondecreasing sequence \(\{a_{n}; n \in \mathbb N \}\) with \(\lim _{n \rightarrow \infty } a_{n} = \infty \) and \(\lim _{n \rightarrow \infty } a_{n+1}/a_{n} = 1\) and given nondecreasing function \(h(\cdot ): (0, \infty ) \rightarrow (0, \infty )\) with \(\lim _{x \rightarrow \infty } h(x) = \infty \) , there exists a sequence \(\{X, X_{n}; n \in \mathbb N \}\) of symmetric i.i.d. random variables such that \(\mathbb E h(|X|) = \infty \) and, for some subsequence \(\{n_{k}; k \in \mathbb N \}\) of \(\mathbb N \) , \( S_{n_{k}}/\sqrt{n_{k}a_{n_{k}}} \Rightarrow N(0, 1)\) . In particular, for given \(0 < p < 2\) and given nondecreasing function \(h(\cdot ): (0, \infty ) \rightarrow (0, \infty )\) with \(\lim _{x \rightarrow \infty } h(x) = \infty \) , there exists a sequence \(\{X, X_{n}; n \in \mathbb N \}\) of symmetric i.i.d. random variables such that \(\mathbb E h(|X|) = \infty \) and, for some subsequence \(\{n_{k}; k \in \mathbb N \}\) of \(\mathbb N \) , \( S_{n_{k}}/n_{k}^{1/p} \Rightarrow N(0, 1)\) .     

Comparing several exponential populations with more than one control

Suppose there are k ₁ (k ₁ ≥ 1) test treatments that we wish to compare with k ₂ (k ₂ ≥ 1) control treatments. Assume that the observations from the ith test treatment and the jth control treatment follow a two-parameter exponential distribution and , where θ is a common scale parameter and and are the location parameters of the ith test and the jth control treatment, respectively, i = 1, . . . ,k ₁; j = 1, . . . ,k ₂. In this paper, simultaneous one-sided and two-sided confidence intervals are proposed for all k ₁ k ₂ differences between the test treatment location and control treatment location parameters, namely , and the required critical points are provided. Discussions of multiple comparisons of all test treatments with the best control treatment and an optimal sample size allocation are given. Finally, it is shown that the critical points obtained can be used to construct simultaneous confidence intervals for Pareto distribution location parameters.     

A comparison of methods for constructing confidence intervals on contrasts in a three-factor mixed model

This paper compares several methods for constructing a confidence interval on contrasts of fixed effects in a balanced three-factor mixed factorial design with one fixed effect and two random effects. In particular, confidence intervals constructed using PROC MIXED of SAS are compared to other intervals that have been proposed in the literature. Computer simulation is used to compare interval lengths, and determine each method's ability to maintain the stated confidence coefficient.     

Biased estimation of a variance

Summary Let , whereX _i are i.i.d. random variables with a finite variance σ² and is the usual estimate of the mean ofX _i. We consider the problem of finding optimal α with respect to the minimization of the expected value of |S ²(σ)−σ²|^k for variousk and with respect to Pitman's nearness criterion. For the Gaussian case analytical results are obtained and for some non-Gaussian cases we present Monte Carlo results regarding Pitman's criteron. This research was supported by Science Fund of Serbia, grant number 04M03, through Mathematical Institute, Belgrade.     

From Optimality Robustness To Sufficiency and Completeness

Let (\Omega,{\cal A},{\cal P}) stand for a statistical experiment and {\cal B},{\cal C} for some sub- σ -algebras of {\cal A} with {\cal C}\subset {\cal B} . It is shown that for any {\cal B} -measurable d\in\bigcap_{P\in {\cal P}}\,{\cal L}_{2}(\Omega,{\cal A},P) there exists some d_{1}\in\bigcap_{P\in {\cal P}}{\cal L}_{2}(\Omega,{\cal A},P) being {\cal C} -measurable and a UMVU estimator in (\Omega,{\cal A},{\cal P}) and some conditional white noise d_{2}\in\bigcap_{P\in {\cal P}}\,{\cal L}_{2}(\Omega,{\cal A},P) , i.e. E_{P}(d_{2}\vert {\cal C})=0,P\in {\cal P} , satisfying d=d_{1}+d_{2} , where d_{j},j=1,2 , are uniquely determined up to P -zero sets, if and only if {\cal C} is sufficient and complete for {\cal P}\vert {\cal B} and {\cal B} is optimality robust for {\cal P} , i.e. any {\cal B} -measurable d\in\bigcap_{P\in {\cal P}}\,{\cal L}_{2}(\Omega,{\cal A},P) being some UMVU estimator in the restricted statistical experiment (\Omega,{\cal B},{\cal P}\vert {\cal B}) is already a UMVU estimator in the original statistical experiment (\Omega,{\cal A},{\cal P}) . In particular, the special case {\cal B}={\cal A} characterizes sufficiency and completeness of {\cal C} for {\cal P} and the special case {\cal B}={\cal C} optimality robustness and completeness of {\cal C} for {\cal P} from a decomposition theoretical point of view. As an application it is shown that a σ -algebra containing a sufficient and complete sub- σ -algebra is optimality robust without being itself in general neither sufficient nor complete.