Mixed-Poisson Point Process with Partially-Observed Covariates: Ecological Momentary Assessment of Smoking

Ecological Momentary Assessment is an emerging method of data collection in behavioral research that may be used to capture the times of repeated behavioral events on electronic devices, and information on subjects' psychological states through the electronic administration of questionnaires at times selected from a probability-based design as well as the event times. A method for fitting a mixed Poisson point process model is proposed for the impact of partially-observed, time-varying covariates on the timing of repeated behavioral events. A random frailty is included in the point-process intensity to describe variation among subjects in baseline rates of event occurrence. Covariate coefficients are estimated using estimating equations constructed by replacing the integrated intensity in the Poisson score equations with a design-unbiased estimator. An estimator is also proposed for the variance of the random frailties. Our estimators are robust in the sense that no model assumptions are made regarding the distribution of the time-varying covariates or the distribution of the random effects. However, subject effects are estimated under gamma frailties using an approximate hierarchical likelihood. The proposed approach is illustrated using smoking data.     

Hierarchical Bayesian modeling of marked non-homogeneous Poisson processes with finite mixtures and inclusion of covariate information

We investigate marked non-homogeneous Poisson processes using finite mixtures of bivariate normal components to model the spatial intensity function. We employ a Bayesian hierarchical framework for estimation of the parameters in the model, and propose an approach for including covariate information in this context. The methodology is exemplified through an application involving modeling of and inference for tornado occurrences.     

Exact and approximate runs distributions

Let R = R_n denote the total (and unconditional) number of runs of successes or failures in a sequence of n Bernoulll (p) trials, where p is assumed to be known throughout. The exact distribution of R is related to a convolution of two negative binomial random variables with parameters p and q (=1-p). Using the representation of R as the sum of 1 - dependent indicators, a Berry - Esséen theorem is derived; the obtained rate of sup norm convergence is O(n^-½). This yields an unconditional version of the classical result of Wald and Wolfowitz (1940). The Stein - Chen method for m - dependent random variables is used, together with a suitable coupling, to prove a Poisson limit theorem for R. but with the limiting support set being the set of odd integers, Total variation error bounds (of order O(p) are found for the last result. Applications are indicated.     

Screening for unusual matched segments in multiple protein sequences

Given a sequence of i.i.d. integer valued random variables, we derive the distribution of the minimum sum of any W consecutive variables. We apply these results to evaluate the unusualness of matches (perfect or almost perfect) in multiply aligned sequences, and matches in all possible alignments of sequences.     

A mixed poisson–inverse-gaussian regression model

The mixed Poisson–inverse-Gaussian distribution has been used by Holla, Sankaran, Sichel, and others in univariate problems involving counts. We propose a Poisson–inverse-Gaussian regression model which can be used for regression analysis of counts. The model provides an attractive framework for incorporating random effects in Poisson regression models and in handling extra-Poisson variation. Maximum-likelihood and quasilikelihood-moment estimation is investigated and illustrated with an example involving motor-insurance claims.     

Joint distribution of rises,falls, and number of runs in random sequences

By using the matrix formulation of the two-step approach to the distributions of runs, a recursive relation and an explicit expression are derived for the generating function of the joint distribution of rises and falls for multivariate random sequences in terms of generating functions of individual letters, from which the generating functions of the joint distribution of rises, falls, and number of runs are obtained. An explicit formula for the joint distribution of rises and falls with arbitrary specification is also obtained.     

An exact formula for the mean squared error of the inverse estimator in the linear calibration problem

The linear calibration problem is considered. An exact formula for the mean squared error of the inverse estimator, involving expectations of functions of a Poisson random variable, is derived. The formula may be expressed in closed form if the number of observations in the calibration experiment is odd; for an even number of observations, the numerical evaluation of a simple integral or the use of a standard table of the confluent hypergeometric function is required. Previous expressions for the mean squared error have either been asymptotic expansions or estimates obtained by simulation.     

Improved Measures of the Spread of Data for Some Unknown Complex Distributions Using Saddlepoint Approximations

Measures of the spread of data for random sums arise frequently in many problems and have a wide range of applications in real life, such as in the insurance field (e.g., the total claim size in a portfolio). The exact distribution of random sums is extremely difficult to determine, and normal approximation usually performs very badly for this complex distributions. A better method of approximating a random-sum distribution involves the use of saddlepoint approximations.

Saddlepoint approximations are powerful tools for providing accurate expressions for distribution functions that are not known in closed form. This method not only yields an accurate approximation near the center of the distribution but also controls the relative error in the far tail of the distribution.

In this article, we discuss approximations to the unknown complex random-sum Poisson–Erlang random variable, which has a continuous distribution, and the random-sum Poisson-negative binomial random variable, which has a discrete distribution. We show that the saddlepoint approximation method is not only quick, dependable, stable, and accurate enough for general statistical inference but is also applicable without deep knowledge of probability theory. Numerical examples of application of the saddlepoint approximation method to continuous and discrete random-sum Poisson distributions are presented.     

Likelihood-based and Bayesian methods for Tweedie compound Poisson linear mixed models

The Tweedie compound Poisson distribution is a subclass of the exponential dispersion family with a power variance function, in which the value of the power index lies in the interval (1,2). It is well known that the Tweedie compound Poisson density function is not analytically tractable, and numerical procedures that allow the density to be accurately and fast evaluated did not appear until fairly recently. Unsurprisingly, there has been little statistical literature devoted to full maximum likelihood inference for Tweedie compound Poisson mixed models. To date, the focus has been on estimation methods in the quasi-likelihood framework. Further, Tweedie compound Poisson mixed models involve an unknown variance function, which has a significant impact on hypothesis tests and predictive uncertainty measures. The estimation of the unknown variance function is thus of independent interest in many applications. However, quasi-likelihood-based methods are not well suited to this task. This paper presents several likelihood-based inferential methods for the Tweedie compound Poisson mixed model that enable estimation of the variance function from the data. These algorithms include the likelihood approximation method, in which both the integral over the random effects and the compound Poisson density function are evaluated numerically; and the latent variable approach, in which maximum likelihood estimation is carried out via the Monte Carlo EM algorithm, without the need for approximating the density function. In addition, we derive the corresponding Markov Chain Monte Carlo algorithm for a Bayesian formulation of the mixed model. We demonstrate the use of the various methods through a numerical example, and conduct an array of simulation studies to evaluate the statistical properties of the proposed estimators.     

A joint model for hierarchical continuous and zero-inflated overdispersed count data

Many applications in public health, medical and biomedical or other studies demand modelling of two or more longitudinal outcomes jointly to get better insight into their joint evolution. In this regard, a joint model for a longitudinal continuous and a count sequence, the latter possibly overdispersed and zero-inflated (ZI), will be specified that assembles aspects coming from each one of them into one single model. Further, a subject-specific random effect is included to account for the correlation in the continuous outcome. For the count outcome, clustering and overdispersion are accommodated through two distinct sets of random effects in a generalized linear model as proposed by Molenberghs et al. [A family of generalized linear models for repeated measures with normal and conjugate random effects. Stat Sci. 2010;25:325–347]; one is normally distributed, the other conjugate to the outcome distribution. The association among the two sequences is captured by correlating the normal random effects describing the continuous and count outcome sequences, respectively. An excessive number of zero counts is often accounted for by using a so-called ZI or hurdle model. ZI models combine either a Poisson or negative-binomial model with an atom at zero as a mixture, while the hurdle model separately handles the zero observations and the positive counts. This paper proposes a general joint modelling framework in which all these features can appear together. We illustrate the proposed method with a case study and examine it further with simulations.     

Information geodesics for gamma models of communication clustering

Recently, Akyildiz called for further work on non-Poisson models for communication arrivals in distributed networks such as cellular phone systems. The basic ‘random’ model for stochastic events is the Poisson process; for events on a line this resuits in an exponential disiribuuon of intervals between events. Network designers and managers need too monotor and quantify call clustering in order to optimize resaurce usage; the natural reference state from which to measure departures is that arising from a Poisson, process of calls. Here we consider gamma distributions, which contain exponential distributions as a special case. The surface representing gamma models has a natural Riemannian information metric and we obtain some geodesic sprays for this metric. The exponential distributions form a 1-dimensional subspace of the 2-dimensional space of all gamma distributions, so we have an isometric embedding of the random model as a subspace of the gamma models. This geometry may provide an appropriate structure on which to represent clustering as quantifiable departures from randomness and on which to impose dynamic control algorithms to optimize traffic at receiving nodes in distributed communication networks. In practice, we may expect correlation between call arrival times and call duration, reflecting for example peaks of different users of internet services. This would give rise to a twisted product of two surfaces with the twisting controlled by the correlation. Though bivariate gamma models do exist, such as Kibble's, none has tractabie information geometry nor sufficiently general marginal gammas,but a simulation method of approach is suggested.     

Modelling and simulation for one‐day cricket

This article is concerned with the simulation of one‐day cricket matches. Given that only a finite number of outcomes can occur on each ball that is bowled, a discrete generator on a finite set is developed where the outcome probabilities are estimated from historical data involving one‐day international cricket matches. The probabilities depend on the batsman, the bowler, the number of wickets lost, the number of balls bowled and the innings. The proposed simulator appears to do a reasonable job at producing realistic results. The simulator allows investigators to address complex questions involving one‐day cricket matches. The Canadian Journal of Statistics © 2009 Statistical Society of Canada     

Symbolic solutions of some linear recurrences

A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a random variable with no reference to any probability space. We give several examples of applications and state an explicit form for the class of linear recurrences involving Sheffer sequences satisfying a special initial condition. The results here presented can be easily implemented in a symbolic software.     

Statistical control charts for shifted generalized poisson distribution

Summary The use of shifted (or zero-truncated) generalized Poisson distribution to describe the occurrence of events in production processes is considered. The methods of moments and maximum likelihood are proposed for estimating the parameters of shifted generalized Poisson distribution. Control charts for the total number of events and for the average number of events are developed. Finally, a numerical example is used to illustrate the construction of control charts.     

A new method for fast computing unbiased estimators of cumulants

We propose new algorithms for generating k-statistics, multivariate k-statistics, polykays and multivariate polykays. The resulting computational times are very fast compared with procedures existing in the literature. Such speeding up is obtained by means of a symbolic method arising from the classical umbral calculus. The classical umbral calculus is a light syntax that involves only elementary rules to managing sequences of numbers or polynomials. The cornerstone of the procedures here introduced is the connection between cumulants of a random variable and a suitable compound Poisson random variable. Such a connection holds also for multivariate random variables.     

Time Series Models for Count or Qualitative Observations

Time series sometimes consist of count data in which the number of events occurring in a given time interval is recorded. Such data are necessarily nonnegative integers, and an assumption of a Poisson or negative binomial distribution is often appropriate. This article sets ups a model in which the level of the process generating the observations changes over time. A recursion analogous to the Kalman filter is used to construct the likelihood function and to make predictions of future observations. Qualitative variables, based on a binomial or multinomial distribution, may be handled in a similar way. The model for count data may be extended to include explanatory variables. This enables nonstochastic slope and seasonal components to be included in the model, as well as permitting intervention analysis. The techniques are illustrated with a number of applications, and an attempt is made to develop a model-selection strategy along the lines of that used for Gaussian structural time series models. The applications include an analysis of the results of international football matches played between England and Scotland and an assessment of the effect of the British seat-belt law on the drivers of light-goods vehicles.     

Euler characteristic heuristic for approximating the distribution of the largest eigenvalue of an orthogonally invariant random matrix

The Euler characteristic heuristic has been proposed as a method for approximating the upper tail probability of the maximum of a random field with smooth sample path. When the random field is Gaussian, this method is proved to be valid in the sense that the relative approximation error is exponentially smaller. However, very little is known about the validity of the method when the random field is non-Gaussian. In this paper, as a milestone to developing the general theory about the validity of the Euler characteristic heuristic, we examine the Euler characteristic heuristic for approximating the distribution of the largest eigenvalue of an orthogonally invariant non-Gaussian random matrix. In this particular example, if the probability density function of the random matrix converges to zero sufficiently fast at the boundary of its support, the approximation error of the Euler characteristic heuristic is proved to be small and the approximation is valid. Moreover, for several standard orthogonally invariant random matrices, the approximation formula for the distribution of the largest eigenvalue and its asymptotic error are obtained explicitly. Our formulas are practical enough for the purpose of numerical calculations.     

Monte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson process

A large-scale study, in which two million random Voronoi polygons (with respect to a homogeneous Poisson point process) were generated and mensurated, is described. The polygon characteristics recorded are number of sides (or vertices), perimeter, area and interior angles. A feature is the efficient “quantile” method of replicating Poisson-type random structures, which it is hoped may find useful application elsewhere.     

Poisson Regression and the Case-Crossover Design: Similarities and Differences

Poisson regression and case-crossover are frequently used methods to estimate transient risks of environmental exposures such as particulate air pollution on acute events such as mortality. Roughly speaking, a case-crossover design results from a Poisson regression by conditioning on the total number of failures. We show that the case-crossover design is somewhat more generally applicable than Poisson regression. Stratification in the case-crossover design is analogous to Poisson regression with dummy variables, or to a marked Poisson regression. Poisson regression makes it possible to express case-crossover likelihood functions as multinomial likelihoods without making reference to cases, controls, or matching. This derivation avoids the counterintuitive notion of basing inferences on exposures that occur post-failure.     

On a bayesian approach for the shiftpoint problem

Using a direct resampling process, a Bayesian approach is developed for the analysis of the shiftpoint problem. In many problems it is straight forward to isolate the marginal posterior distribution of the shift-point parameter and the conditional distribution of some of the parameters given the shift point and the other remaining parameters. When this is possible, a direct sampling approach is easily implemented whereby standard random number generators can be used to generate samples from the joint posterior distribution of aii the parameters in the model. This technique is illustrated with examples involving one shift for Poisson processes and regression models.