Asymptotic Results for the MPL Estimators of the Contact Process of Order p

Let X be a discrete time contact process (CP) of order p on Z ² as defined by Durrett and Levin (1994 Durrett , R. , Levin , S. A. ( 1994 ). Stochastic spatial models: a user's guide to ecological applications . Phil. Trans. Roy. Soc. Lond. B 343 : 329 – 350 .[Crossref], [Web of Science ®] , [Google Scholar]), that is a CP where the function of birth takes p different values. We study the maximum marginal pseudo-likelihood (MPL) estimator of the model based on space-time evolution of X, that is, T + 1 successive observations of X on a finite subset S of sites. When T → ∞, this estimator is consistent and asymptotically normal for a non vanishing supercritical CP. We also propose a statistical test for the parameters of the model and verify the asymptotic results by some simulation studies.     

The particle filter based on random number searching algorithm for parameter estimation

This article addresses the issue of parameter estimation in linear system in the presence of Gaussian noises, under which the random number searching algorithm (LJ (Luus and Jaakola) algorithm) is combined with the Rao-Blackwellised particle filter (RBPF) algorithm. This yields the so-called RBPF algorithm based on LJ (RBPF-LJ). Unlike the mature alternatives of generic particle filter, the parameter particles of RBPF-LJ are set as random numbers that search in the parameter value scope, which is regulated based on the estimation result to track the changes of the unknown parameter. The contrasting simulations show that the proposed RBPF-LJ outperform the RBPF as well as the particle filter based on kernel smoothing contraction algorithm on the estimation of the dynamically linear or nonlinear parameter and it can obtain the similar estimation results on the static parameter if some coefficients are regulated.     

Parameter estimation for fractional Poisson processes

The paper proposes a formal estimation procedure for parameters of the fractional Poisson process (fPp). Such procedures are needed to make the fPp model usable in applied situations. The basic idea of fPp, motivated by experimental data with long memory is to make the standard Poisson model more flexible by permitting non-exponential, heavy-tailed distributions of interarrival times and different scaling properties. We establish the asymptotic normality of our estimators for the two parameters appearing in our fPp model. This fact permits construction of the corresponding confidence intervals. The properties of the estimators are then tested using simulated data.     

Efficient estimation in a nonlinear counting-process regression model

Suppose we observe i.i.d. copies of X, C, Y, where X is a counting process, C is a censoring process talcing only values 0 and 1, and Y is a covariate process. Assume that the intensity process of X is of the form C(s)a(s, Y(s)) with a unknown, but that the distribution of X, C, Y is unspecified otherwise. McKeague and Utikal proposed an estimator for the doubly cumulative hazard f f a(s, y) ds dy and determined its asymptotic distribution. We show that the estimator is regular and efficient in the sense of a Hájek-Inagaki convolution theorem for partially specified models.     

Exact computation of minimum sample size for estimation of binomial parameters

It is indicated by some researchers in the literature that it might be difficult to exactly determine the minimum sample size for the estimation of a binomial parameter with prescribed margin of error and confidence level. In this paper, we investigate such a very old but also extremely important problem and demonstrate that the difficulty for obtaining the exact solution is not insurmountable. Unlike the classical approximate sample size method based on the central limit theorem, we develop a new approach for computing the minimum sample size that does not require any approximation. Moreover, our approach overcomes the conservatism of existing rigorous sample size methods derived from Bernoulli's theorem or Chernoff-Hoeffding bound.Our computational machinery consists of two essential ingredients. First, we prove that the minimum of coverage probability with respect to a binomial parameter bounded in an interval is attained at a discrete set of finite many values of the binomial parameter. This allows for reducing infinite many evaluations of coverage probability to finite many evaluations. Second, a recursive bounding technique is developed to further improve the efficiency of computation.     

Parameter estimation in a verhulst stochastic model

Summary Maximum likelihood estimation is a well-known statistical tool. When applied to the study of dynamical continuous-time phenomena, it requires some specific assumptions. In this paper we discuss some properties of the maximum likelihood estimator for a stochastic Verhulst model and we show some simulation results on the behaviour of the corresponding discrete estimator.     

Bayesian inference for a discretely observed stochastic kinetic model

The ability to infer parameters of gene regulatory networks is emerging as a key problem in systems biology. The biochemical data are intrinsically stochastic and tend to be observed by means of discrete-time sampling systems, which are often limited in their completeness. In this paper we explore how to make Bayesian inference for the kinetic rate constants of regulatory networks, using the stochastic kinetic Lotka-Volterra system as a model. This simple model describes behaviour typical of many biochemical networks which exhibit auto-regulatory behaviour. Various MCMC algorithms are described and their performance evaluated in several data-poor scenarios. An algorithm based on an approximating process is shown to be particularly efficient.     

Isotonic estimation of the intensity of a nonhomogeneous Poisson process: The multiple realization setup

In the 1950s Brunk and Van Eeden each obtained maximum-likelihood estimators of a finite product of probability density functions under partial or complete ordering of their parameters. Their results play an important role in the general theory of inference under order restrictions and lead to an isotonic estimator of the intensity of a nonhomogeneous Poisson process. Here an elementary derivation of the maximum likelihood estimator (m.l.e.) for the intensity of a nonhomogeneous Poisson process is given when several (possibly censored) realizations are available. Boswell obtained the m.l.e. based on a single realization as well as a conditional m.l.e. under the same conditions. An example is given to show that in the multirealization setup a conditional m.l.e. may not exist; the proofs are, we believe, new and elementary. An illustrative application is given.     

Parameter estimation in an alternating repair model

The Weibull intensity is often used in survival analysis of technical products, it is an extremely important intensity to characterize the probabilistic behavior of a large number of real phenomena. This intensity is especially useful as a failure model analyzing the reliability of different types of systems. In this paper we develop statistical methods for an alternating repair model using Weibull intensity. The maximum likelihood estimator is considered for determining the estimations of the model parameters. The distribution of the life times after perfect repairs and imperfect repairs are obtained. The estimation of the Fisher information matrix is given. Simultaneous confidence regions based on the likelihood ratio statistics are developed for the estimators of the shape and scale parameter of the Weibull intensity. Finally simulation study will be given.     

Parameter estimation for a deformable template model

In recent years, a number of statistical models have been proposed for the purposes of high-level image analysis tasks such as object recognition. However, in general, these models remain hard to use in practice, partly as a result of their complexity, partly through lack of software. In this paper we concentrate on a particular deformable template model which has proved potentially useful for locating and labelling cells in microscope slides Rue and Hurn (1999). This model requires the specification of a number of rather non-intuitive parameters which control the shape variability of the deformed templates. Our goal is to arrange the estimation of these parameters in such a way that the microscope user's expertise is exploited to provide the necessary training data graphically by identifying a number of cells displayed on a computer screen, but that no additional statistical input is required. In this paper we use maximum likelihood estimation incorporating the error structure in the generation of our training data.     

Bayes sequential estimation for a time-transformed exponential model

A problem of Bayesian sequential estimating an unknown parameter of a time-transformed exponential model is considered. It is supposed that the loss associated with the error of estimation is weighted squared or precautionary and the cost of observing the process is a function of time and the number of observations. Bayes sequential procedures for estimating the unknown parameter are presented.     

Empirical bayes estimation of a distribution function with a gamma process prior

A sequence of empirical Bayes estimators is given for estimating a distribution function. It is shown that ‘i’ this sequence is asymptotically optimum relative to a Gamma process prior, ‘ii’ the overall expected loss approaches the minimum Bayes risk at a rate of n , and ‘iii’ the estimators form a sequence of proper distribution functions. Finally, the numerical example presented by Susarla and Van Ryzin ‘Ann. Statist., 6, 1978’ reworked by Phadia ‘Ann. Statist., 1, 1980, to appear’ has been analyzed and the results are compared to the numerical results by Phadia     

Robust parameter estimation of regression model with AR(p) error terms

In this article, we consider a linear regression model with AR(p) error terms with the assumption that the error terms have a t distribution as a heavy-tailed alternative to the normal distribution. We obtain the estimators for the model parameters by using the conditional maximum likelihood (CML) method. We conduct an iteratively reweighting algorithm (IRA) to find the estimates for the parameters of interest. We provide a simulation study and three real data examples to illustrate the performance of the proposed robust estimators based on t distribution.     

Asymptotic theory and inference of predictive mean matching imputation using a superpopulation model framework

Predictive mean matching imputation is popular for handling item nonresponse in survey sampling. In this article, we study the asymptotic properties of the predictive mean matching estimator for finite-population inference using a superpopulation model framework. We also clarify conditions for its robustness. For variance estimation, the conventional bootstrap inference is invalid for matching estimators with a fixed number of matches due to the nonsmoothness nature of the matching estimator. We propose a new replication variance estimator, which is asymptotically valid. The key strategy is to construct replicates directly based on the linear terms of the martingale representation for the matching estimator, instead of individual records of variables. Simulation studies confirm that the proposed method provides valid inference.     

Simultaneous sparse model selection and coefficient estimation for heavy-tailed autoregressive processes

We propose a sparse coefficient estimation and automated model selection procedure for autoregressive processes with heavy-tailed innovations based on penalized conditional maximum likelihood. Under mild moment conditions on the innovation processes, the penalized conditional maximum likelihood estimator satisfies a strong consistency, O_P(N^?1/2) consistency, and the oracle properties, where N is the sample size. We have the freedom in choosing penalty functions based on the weak conditions on them. Two penalty functions, least absolute shrinkage and selection operator and smoothly clipped average deviation, are compared. The proposed method provides a distribution-based penalized inference to AR models, which is especially useful when the other estimation methods fail or under perform for AR processes with heavy-tailed innovations [Feigin, Resnick. Pitfalls of fitting autoregressive models for heavy-tailed time series. Extremes. 1999;1:391–422]. A simulation study confirms our theoretical results. At the end, we apply our method to a historical price data of the US Industrial Production Index for consumer goods, and obtain very promising results.     

Nonparametric estimation of a regression function from backward recurrence times in a cross-sectional sampling

This study considers the nonparametric estimation of a regression function when the response variable is the waiting time between two consecutive events of a stationary renewal process, and where this variable is not completely observed. In these circumstances, our data are the recurrence times from the occurrence of the last event up to a pre-established time, along with the corresponding values of a certain set of covariates. Estimation of the error density function and some of its characteristics are also considered. For the proposed estimators, we first analyze their asymptotic behavior and, thereafter, carry out a simulation study to highlight their behavior in finite samples. Finally, we apply this methodology to an illustrative example with biomedical data.     

Bias reduction in the estimation of a shape second-order parameter of a heavy-tailed model

In extreme value theory, the shape second-order parameter is a quite relevant parameter related to the speed of convergence of maximum values, linearly normalized, towards its limit law. The adequate estimation of this parameter is vital for improving the estimation of the extreme value index, the primary parameter in statistics of extremes. In this article, we consider a recent class of semi-parametric estimators of the shape second-order parameter for heavy right-tailed models. These estimators, based on the largest order statistics, depend on a real tuning parameter, which makes them highly flexible and possibly unbiased for several underlying models. In this article, we are interested in the adaptive choice of such tuning parameter and the number of top order statistics used in the estimation procedure. The performance of the methodology for the adaptive choice of parameters is evaluated through a Monte Carlo simulation study.     

Improved maximum-likelihood estimation in a regression model with general parametrization

We analyse the finite-sample behaviour of two second-order bias-corrected alternatives to the maximum-likelihood estimator of the parameters in a multivariate normal regression model with general parametrization proposed by Patriota and Lemonte [A.G. Patriota and A.J. Lemonte, Bias correction in a multivariate regression model with genereal parameterization, Stat. Prob. Lett. 79 (2009), pp. 1655–1662]. The two finite-sample corrections we consider are the conventional second-order bias-corrected estimator and the bootstrap bias correction. We present the numerical results comparing the performance of these estimators. Our results reveal that analytical bias correction outperforms numerical bias corrections obtained from bootstrapping schemes.     

On the maximum likelihood estimation of parameters of a spatial discrimination model

Consideration is given here to the problem of maximum likelihood estimation of parameters in a sparial discrimination model which was proposed by switzer (1980). some moments of these estimators are derived. These results extend the work of Mardia (1984) who gave expressions for these estimators without their moments.