The analysis of some biological data

This paper considers the building of stochastic models and the related analysis of discrete data in two biological problems, The first arises from the reproduction of yeast cells, while the secondis concerned with the aggregation of nucleoli. Galton-Watson and aggregation models are constructed for the respective processes and their goodness of fit to the data tested     

Local efficiency of moment estimators in beta-binomial model

In this paper, the beta-binomial model is introduced as a Markov chain. It is shown that the correlated binomial model of Kupper and Haseman (1978) is identical to the additive binomial model of AItham(1978) and both are a first order approximation of the beta-binomial model. For small γ, the local efficiency of the moment estimators for the mean ρ and the extra-binomial variation γ is examined analytically. It is shown that, locally, the moment estimator for p is efficient up to the second order of y. Exact formulae for the relative efficiency are obtained for both the cases with γ known and unknown. Generalization to the unequal sample size case is also carried out. In particular, the gain in efficiency by using the quasi-likelihood estimator instead of the ratio estimator for p is studied when γ is known. These results are in agreement with the Monte Carlo results of Kleinman(1973) and Crowder(1985).     

Parsimonious Estimation of the Covariance Matrix in Multinomial Probit Models

This article presents a Bayesian analysis of a multinomial probit model by building on previous work that specified priors on identified parameters. The main contribution of our article is to propose a prior on the covariance matrix of the latent utilities that permits elements of the inverse of the covariance matrix to be identically zero. This allows a parsimonious representation of the covariance matrix when such parsimony exists. The methodology is applied to both simulated and real data, and its ability to obtain more efficient estimators of the covariance matrix and regression coefficients is assessed using simulated data.     

A Bayesian Model for Markov Chains via Jeffrey's Prior

Abstract

This work deals with the problem of Bayesian estimation of the transition probabilities associated with multistate Markov chain. The model is based on the Jeffreys' noninformative prior. The Bayesian estimator is approximated by means of MCMC techniques. A numerical study by simulation is done in order to compare the Bayesian estimator with the maximum likelihood estimator.     

SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace–Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

Estimation of Dynamic Bivariate Mixture Models

This note compares a Bayesian Markov chain Monte Carlo approach implemented by Watanabe with a maximum likelihood ML approach based on an efficient importance sampling procedure to estimate dynamic bivariate mixture models. In these models, stock price volatility and trading volume are jointly directed by the unobservable number of price-relevant information arrivals, which is specified as a serially correlated random variable. It is shown that the efficient importance sampling technique is extremely accurate and that it produces results that differ significantly from those reported by Watanabe.     

The Estimation of Dynamic Bivariate Mixture Models

Watanabe estimated the dynamic bivariate mixture models introduced by Tauchen and Pitts and modified by Andersen using a Bayesian method via Markov chain Monte Carlo techniques. Based on a maximum likelihood method via efficient importance sampling, Liesenfeld and Richard obtained estimates that are significantly different from those of Watanabe. This note corrects the error in the multimove sampler used by Watanabe and reproduces all analyses in the work of Watanabe using a corrected multimove sampler. The estimates using the correct multimove sampler are found to be close to those obtained by Liesenfeld and Richard.     

Quotas on runs of successes and failures in a multi-state markov chain

For the time-homogeneous multi-state Markov chain {X_n,n≧0} with states labeled as "0" (success) and "f"(failure), f=1,2,… the waiting time problems to be discussed arise by setting quotas on runs of success and failures. Some particular cases are considered.     

The Modeling and Seasonal Adjustment of Weekly Observations

Several important economic time series are recorded on a particular day every week. Seasonal adjustment of such series is difficult because the number of weeks varies between 52 and 53 and the position of the recording day changes from year to year. In addition certain festivals, most notably Easter, take place at different times according to the year. This article presents a solution to problems of this kind by setting up a structural time series model that allows the seasonal pattern to evolve over time and enables trend extraction and seasonal adjustment to be carried out by means of state-space filtering and smoothing algorithms. The method is illustrated with a Bank of England series on the money supply.