Environmental stochasticity of gompertz model with time delay

We consider the environmental stochasticity of the Gompertz model with time delay when the parameters are assumed to be described by correlated Gaussian white noise processes. The delay kernel is assumed to be exponentially decaying and the Fokker-Planck equation is obtained in both the Stratonovich and Ito calculi. The exact expressions for the first and second order moments of the logarithm of population size are evaluated and the stability of the system in mean as well as In mean-square is discussed.     

A Monte Carlo method for filtering a marked doubly stochastic Poisson process

The author provides an approximated solution for the filtering of a state-space model, where the hidden state process is a continuous-time pure jump Markov process and the observations come from marked point processes. Each state k corresponds to a different marked point process, defined by its conditional intensity function λ _k (t). When a state is visited by the hidden process, the corresponding marked point process is observed. The filtering equations are obtained by applying the innovation method and the integral representation theorem of a point process martingale. Since the filtering equations belong to the family of Kushner–Stratonovich equations, an iterative solution is calculated. The theoretical solution is approximated and a Monte Carlo integration technique employed to implement it. The sequential method has been tested on a simulated data set based on marked point processes widely used in the statistical analysis of seismic sequences: the Poisson model, the stress release model and the Etas model.     

Percentiles from a set of classes or from the raw data? an argument based on the trinomial distribution

In a former study (Chatillon, Gelinas, Martin and Laurencelle, 1987), the authors arrived at the conclusion that for small to moderate sample sizes (n≦90), and for population distributions that are not too skewed nor heavy tailed, the percentiles computed from a set of 9 classes are at least as precise as the corresponding percentiles computed with raw data. Their proof was based essentially on Monte Carlo simulations. The present paper gives a different and complementary proof, based on an exact evaluation of the mean squared error. The method of proof uses the trinomial distribution in an interesting way.     

Mathematical proof of the third order accuracy of the speedy double bootstrap method

Abstract

In our previous research, we proposed a speedy double bootstrap method for assessing the reliability of statistical models with maximum log-likelihood criterion. It can provide 3rd order accurate probabilities. In this study, our focus switches to the mathematical proof. We propose an alternative proof of the third order accuracy in the context of the multivariate normal model. Our proof is based on tube formula differential geometric methodology and an Taylor series approach to the asymptotic analysis of the bootstrap method.     

A consistency result in general censoring models

In this paper we prove a consistency result for sieved maximum likelihood estimators of the density in general random censoring models with covariates. The proof is based on the method of functional estimation. The estimation error is decomposed in a deterministic approximation error and the stochastic estimation error. The main part of the proof is to establish a uniform law of large numbers for the conditional log-likelihood functional, by using results and techniques from empirical process theory.     

On the asymptotic normality of functions of uniform spacings

A new proof is given for the asymptotic normality of sum functions of spacings, providing an alternative to the method of Le Cam (1958). The result is obtained under an optimal moment condition. The proof is based on a simple decomposition into a leading term, which is asymptotically normal, and a remainder term, which is shown to be negligible.     

A very simple proof of the multivariate Chebyshev's inequality

Abstract

In this short note, a very simple proof of the Chebyshev's inequality for random vectors is given. This inequality provides a lower bound for the percentage of the population of an arbitrary random vector X with finite mean μ = E(X) and a positive definite covariance matrix V = Cov(X) whose Mahalanobis distance with respect to V to the mean μ is less than a fixed value. The main advantage of the proof is that it is a simple exercise for a first year probability course. An alternative proof based on principal components is also provided. This proof can be used to study the case of a singular covariance matrix V.     

L'Hospital's Rule and the Central Limit Theorem

Beginning probability students are often confused by the use of Taylor polynomials in the proof of the central limit theorem. This article provides a proof of the central limit theorem based on L'Hospital's rule rather than on Taylor polynomials.     

Analytic approach to coset–leader decoding leads to extension of the Welch–Berlekamp theorem

This paper provides a complete proof of the Welch–Berlekamp theorem on which the Welch–Berlekamp algorithm was founded. By introducing an analytic approach to coset–leader decoders for Reed–Solomon codes, the Welch–Berlekamp key-equation of error corrections is enlarged and a complete proof of the Welch–Berlekamp theorem is derived in a natural way, and the theorem is extended such that the BCH-bound constraint is moved.     

A Proof of Bell's Inequality in Quantum Mechanics Using Causal interactions

We give a simple proof of Bell's inequality in quantum mechanics using theory from causal interaction, which, in conjunction with experiments, demonstrates that the local hidden variable assumption is false. The proof sheds light on relationships between the notion of causal interaction and interference between treatments.     

On Khatri's characterization of the inverse-Gaussian distribution

Khatri has given a characterization of the inverse-Gaussian distribution by the independence of two statistics. His proof involves assumptions on the existence of certain moments. In this note, we offer a short proof using only the positivity of the random variable X₁.     

A Simple Probabilistic Proof for the Alternating Convolution of the Central Binomial Coefficients

This note presents a simple probabilistic proof of the identity for the alternating convolution of the central binomial coefficients. The proof of the identity involves the computation of moments of order n for the product of standard normal random variables.     

On estimating the conditional probability of discovering a new species

Based on a capture-recapture sample of size $i;n+k,n≥ l,k ≥ 0, from a population of an unknown number of distinct species (or classes), the problem of estimating the total probability of the species unobserved in the first n selections is considered. As the estimand depends on both the unknown parameters and the data, the standard theory of estimation is inadequate for this problem A suitable definition of sufficiency is introduced and used to prove a Rao-Blackwell type result and discuss uniformly minimum mean squared error unbiased estimation. An alternative proof for an inadmissibility result is presented. The new proof gives more insight and a method for deriving improved estimators. The theoretical developments may be useful in other problems concerning inferences about random parametric functions.     

Spectral and circulant approximations to the likelihood for stationary Gaussian random fields

Consider a Gaussian random field model on , observed on a rectangular region. Suppose it is desired to estimate a set of parameters in the covariance function. Spectral and circulant approximations to the likelihood are often used to facilitate estimation of the parameters. The purpose of the paper is to give a careful treatment of the quality of these approximations. A spectral approximation for the likelihood was given by Guyon (Biometrika 69 (1982) 95–105) but without proof. The results given here generalize those of Guyon, and fill in the details of the proof. In addition some matrix results are derived which may be of independent interest. Applications are made to Fisher information and bias calculations for maximum likelihood estimates.     

A further note on a theorem on the difference of the generalized inverses of two nonnegative definite matrices

Andrews and Phillips (1986) gave a simplified proof for the result that established the nonnegative definiteness of the difference of the Moore-Penrose inverses of two nonoegative definite matrices, a result originally due to Milliken and Akdeniz (1977), The purpose of this paper is to offer a simple proof for a generalization of this result,     

On some expressions for variance,covariance, skewness and L-moments

Some results concerning expressions for moments and L-moments of continuous distributions are given. These include: some decompositions of variance and covariance closely related to decompositions recently given by Yatracos; a similar expression for the population third central moment and a simple proof thereof for nonnegative random variables; an alternative proof of a general expression for L-moments due to Hosking, and some straightforward consequences for inequalities concerning L-moments. Simplicity is a key feature of all results considered in this paper.     

Erratum to the paper: a note on reference prior for the scaler skew-normal distribution

Liseo and Loperfido [A note on reference priors for the scalar skew-normal distribution. J Statist Plann Inference. 2006;136(2):373–389] studied some peculiar features of default Bayes analysis of the scalar skew-normal model. In particular, they showed that, by considering the simplest model with a single unknown parameter λ of skewness, the reference – or Jeffreys’ – prior for this parameter is proper. They proved that tails of Jeffreys’ prior are of order O(λ^?3/2). But they made a mistake in their proof. In this note, we will modify their proof.     

Identification of parametric Rasch-type models

In modern Item Response Theory, the Rasch model is viewed as a Generalized Linear Mixed Model, where the item parameters correspond to the fixed-effects, whereas the person specific parameters are the random-effects. The statistical model, bearing on the observable variables only, is obtained after integrating out the random-effects. Although it is widely accepted that the parameters of this model are identified, it is hard to find a correct justification. Furthermore, the meaning of the parameters of the Rasch model – as well as of its extensions – is typically based on the fixed-effects specification of the model, that is, when the person specific parameters are also treated as fixed-effects. The contribution of this paper is to provide an explicit proof of the identification of the random-effects Rasch model. The proof is valid for a large class of Rasch-type models. It is also shown that such a proof can be applied to analyze the identification of Explanatory Rasch Models. Finally, the meaning of the parameters of interest with respect to the different data generating process is discussed.     

Completeness and optimality of marginal likelihood estimating equations

A counter-example shows that the proof of optimality of the marginal likelihood estimating function for parameter of interest, under the conditions assumed in Lloyd (1987), contains a gap and is, thus, invalid. The same comment applies to the generalized version of Lloyd’s Theorem given by Bhapkar and Srinivasan (1993). In the light of known results concerning Fisher information for parameter of interest and partial sufficiency of a suitable statistic, the counter-example reveals a similar gap in the proof of corollary 3.2 of Bhapkar (1991).     

On asymptotic distribution of prediction in functional linear regression

There has been substantial recent attention on problems involving a functional linear regression model with scalar response. Among them, there have been few works dealing with asymptotic distribution of prediction in functional linear regression models. In recent literature, the centeral limit theorem for prediction has been discussed, but the proof and conditions under which the random bias terms for a fixed predictor converge to zero have been ignored so that the impact of these terms on the convergence of the prediction has not been well understood. Clarifying the proof and conditions under which the bias terms converge to zero, we show that the asymptotic distribution of the prediction is normal. Furthermore, we have derived those results related to other terms that already obtained by others, under milder conditions. Finally, we conduct a simulation study to investigate performance of the asymptotic distribution under various parameter settings.