A Bayesian restoration of an ion channel signal

We present a Bayesian method of ion channel analysis and apply it to a simulated data set. An alternating renewal process prior is assigned to the signal, and an autoregressive process is fitted to the noise. After choosing model hyperconstants to yield 'uninformative' priors on the parameters, the joint posterior distribution is computed by using the reversible jump Markov chain Monte Carlo method. A novel form of simulated tempering is used to improve the mixing of the original sampler.     

Long-Range Dependence of Markov Renewal Processes

This paper examines long‐range dependence (LRD) and asymptotic properties of Markov renewal processes generalizing results of Daley for renewal processes. The Hurst index and discrepancy function, which is the difference between the expected number of arrivals in (0, t] given a point at 0 and the number of arrivals in (0, t] in the time stationary version, are examined in terms of the moment index. The moment index is the supremum of the set of r > 0 such that the rth moment of the first return time to a state is finite, employing the solidarity results of Sgibnev. The results are derived for irreducible, regular Markov renewal processes on countable state spaces. The paper also derives conditions to determine the moment index of the first return times in terms of the Markov renewal kernel distribution functions of the process.     

ON THE MAP/G/1 QUEUE WITH LEBESGUE-DOMINATED SERVICE TIME DISTRIBUTION AND LCFS PREEMPTIVE REPEAT SERVICE DISCIPLINE

The present paper contains an analysis of the MAP/G/1 queue with last come first served (LCFS) preemptive repeat service discipline and Lebesgue-dominated service time distribution. The transient distribution is given in terms of a recursive formula. The stationary distribution as well as the stability condition are obtained by means of Markov renewal theory via a QBD representation of the embedded Markov chain at departures and arrivals.     

Normal Deviation and Poisson Approximation of a Security Market by the Geometric Markov Renewal Processes

We consider the geometric Markov renewal processes (GMRP) as a model for a security market. Normal deviations of the geometric Markov renewal processes for ergodic averaging and double averaging schemes are derived. We introduce Poisson averaging scheme for the geometric Markov renewal processes. European call option pricing formulas for GMRP are presented.     

Piecewise deterministic Markov processes applied to fatigue crack growth modelling

In this paper, we use a particular piecewise deterministic Markov process (PDMP) to model the evolution of a degradation mechanism that may arise in various structural components, namely, the fatigue crack growth. We first derive some probability results on the stochastic dynamics with the help of Markov renewal theory: a closed-form solution for the transition function of the PDMP is given. Then, we investigate some methods to estimate the parameters of the dynamical system, involving Bogolyubov's averaging principle and maximum likelihood estimation for the infinitesimal generator of the underlying jump Markov process. Numerical applications on a real crack data set are given.     

MARKOV CHAINS SATISFYING SIMPLE DRIFT CONDITIONS FOR SUBGEOMETRIC ERGODICITY

This paper is concerned with ergodic Markov chains satisfying a sequence of drift conditions that imply (f, r)- regularity of the chain, by which subgeometric ergodicity is ensured. An interesting exact trade-off result between the exponents of f and r for a special class of state space models by Tuominen and Tweedie (1994) is extended here from integers to real numbers for general Markov chains satisfying these drift conditions simultaneously as well as standard requirements for ergodic Markov chains. In Section 3, we will illustrate by the state space models that the utilization of these drift conditions is a very convenient way to show subgeometric ergodicity of Markov chains including the exact trade-off between the exponents of f and r.     

An automated (Markov chain) Monte Carlo EM algorithm

We present an automated Monte Carlo EM (MCEM) algorithm which efficiently assesses Monte Carlo error in the presence of dependent Monte Carlo, particularly Markov chain Monte Carlo, E-step samples and chooses an appropriate Monte Carlo sample size to minimize this Monte Carlo error with respect to progressive EM step estimates. Monte Carlo error is gauged though an application of the central limit theorem during renewal periods of the MCMC sampler used in the E-step. The resulting normal approximation allows us to construct a rigorous and adaptive rule for updating the Monte Carlo sample size each iteration of the MCEM algorithm. We illustrate our automated routine and compare the performance with competing MCEM algorithms in an analysis of a data set fit by a generalized linear mixed model.     

Joint Modelling of Recurrent Infections and Antibody Response by Bayesian Data Augmentation

Abstract.  A joint dynamic model for the interdependence between infection, immunity and risk of disease is presented. Recurrent latent infections are modelled as realizations from a renewal process and antibody dynamics as a diffusion with a decreasing drift modified by the stimulating effect of the random infections. The augmented submodels are estimated simultaneously in one large Markov chain Monte Carlo algorithm. As an example, we consider the risk of recurrent ear infections when having only partially observed information on bacterial carriage and antibody concentrations.     

Minimal auxiliary Markov chains through sequential elimination of states

When using an auxiliary Markov chain to compute the distribution of a pattern statistic, the computational complexity is directly related to the number of Markov chain states. Theory related to minimal deterministic finite automata have been applied to large state spaces to reduce the number of Markov chain states so that only a minimal set remains. In this paper, a characterization of equivalent states is given so that extraneous states are deleted during the process of forming the state space, improving computational efficiency. The theory extends the applicability of Markov chain based methods for computing the distribution of pattern statistics.     

Reliability of semi-Markov missions

We consider a device that is designed to perform missions consisting of a random sequence of phases or stages with random durations. The mission process is described by a Markov renewal process and the system is a complex one consisting of a number of components whose lifetimes depend on the phases of the mission. We discuss models and tools to compute system, mission, and phase reliabilities using Markov renewal theory. A simplified model involving a mission-based system with maximal repair is analyzed first, and the results are then extended to the case where there is no repair using intrinsic aging concepts. Our objective is to focus on computation of system reliability for these two possible extreme cases.     

Predicting future discoveries of European marine species by using a non-homogeneous renewal process

Summary.  Predicting future rates of species discovery and the number of species remaining are important in efforts to preserve biodiversity, discussions on the rate of species extinction and comparisons on the state of knowledge of animals and plants of different taxa. Data on discovery dates of species in 32 European marine taxa are analysed by using a class of thinned temporal renewal process models. These models allow for both underdispersion and overdispersion with respect to the non-homogeneous Poisson process. An approach for implementing Bayesian inference for these models is described that uses Markov chain Monte Carlo simulation and that is applicable to other types of thinned process. Predictions are made on the number of species remaining to be discovered in each taxon.     

Quantile regression for longitudinal data based on latent Markov subject-specific parameters

We propose a latent Markov quantile regression model for longitudinal data with non-informative drop-out. The observations, conditionally on covariates, are modeled through an asymmetric Laplace distribution. Random effects are assumed to be time-varying and to follow a first order latent Markov chain. This latter assumption is easily interpretable and allows exact inference through an ad hoc EM-type algorithm based on appropriate recursions. Finally, we illustrate the model on a benchmark data set.     

Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities

Importance sampling and Markov chain Monte Carlo methods have been used in exact inference for contingency tables for a long time, however, their performances are not always very satisfactory. In this paper, we propose a stochastic approximation Monte Carlo importance sampling (SAMCIS) method for tackling this problem. SAMCIS is a combination of adaptive Markov chain Monte Carlo and importance sampling, which employs the stochastic approximation Monte Carlo algorithm (Liang et al., J. Am. Stat. Assoc., 102(477):305–320, 2007) to draw samples from an enlarged reference set with a known Markov basis. Compared to the existing importance sampling and Markov chain Monte Carlo methods, SAMCIS has a few advantages, such as fast convergence, ergodicity, and the ability to achieve a desired proportion of valid tables. The numerical results indicate that SAMCIS can outperform the existing importance sampling and Markov chain Monte Carlo methods: It can produce much more accurate estimates in much shorter CPU time than the existing methods, especially for the tables with high degrees of freedom.     

REVERSIBLE JUMP MARKOV CHAIN MONTE CARLO METHODS AND SEGMENTATION ALGORITHMS IN HIDDEN MARKOV MODELS

We consider hidden Markov models with an unknown number of regimes for the segmentation of the pixel intensities of digital images that consist of a small set of colours. New reversible jump Markov chain Monte Carlo algorithms to estimate both the dimension and the unknown parameters of the model are introduced. Parameters are updated by random walk Metropolis–Hastings moves, without updating the sequence of the hidden Markov chain. The segmentation (i.e. the estimation of the hidden regimes) is a further aim and is performed by means of a number of competing algorithms. We apply our Bayesian inference and segmentation tools to digital images, which are linearized through the Peano–Hilbert scan, and perform experiments and comparisons on both synthetic images and a real brain magnetic resonance image.     

Lifetime distribution of two discrete censored δ shock models

In this paper, two classes of censored δ shock models are studied. The first model is the lattice renewal binomial censored δ shock model, in which shocks occur independently at discrete time epochs according to Bernoulli trials. The second model is the Markovian-censored δ shock model, in which shocks arrive in accordance with a discrete time Markov chain. In both censored δ shock models, lifetime distributions of the considered systems are derived. By using the probability generating function method, the expectation and variance of the lifetime in the binomial-censored δ shock model are obtained, too. Some numerical examples are also provided to illustrate the proposed model.     

MAXIMUM LIKELIHOOD ESTIMATION OF PARAMETERS IN RENEWAL AND MARKOV-RENEWAL PROCESSES

Sampling procedures using randomized observation-points are suggested for estimating parameters in renewal and Markov renewal models. The usual asymptotic properties of the maximum likelihood method are shown to hold. The method we suggest provides a solution to the ML estimation problem in either or both of the following situations: (i) observations on between-event intervals are unavailable, (ii) the interval densities are unknown or difficult to evaluate while their Laplace-Stieltjes transforms are known.     

Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type

This paper considers the computation of the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, given that the level is not greater than a predefined threshold. This problem has been studied recently and a computational algorithm is proposed under the assumption that matrices representing downward jumps are nonsingular. We first show that this assumption can be eliminated in a general setting of Markov chains of level-dependent G/G/1-type. Next we develop a computational algorithm for the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, by modifying the above-mentioned algorithm slightly. In principle, our algorithm is applicable to any Markov chain of level-dependent M/G/1-type, if the Markov chain is irreducible and positive-recurrent. Furthermore, as an input to the algorithm, we can set an error bound for the computed conditional distribution, which is a notable feature of our algorithm. Some numerical examples are also provided.     

On a discrete interaction risk model with delayed claims and stochastic incomes under random discount rates

In this paper, we study a discrete interaction risk model with delayed claims and stochastic incomes in the framework of the compound binomial model. A generalized Gerber-Shiu discounted penalty function is proposed to analyse this risk model in which the interest rates follow a Markov chain with finite state space. We derive an explicit expression for the generating function of this Gerber-Shiu discounted penalty function. Furthermore, we derive a recursive formula and a defective renewal equation for the original Gerber-Shiu discounted penalty function. As an application, the joint distributions of the surplus one period prior to ruin and the deficit at ruin, as well as the probabilities of ruin are obtained. Finally, some numerical illustrations from a specific example are also given.     

Stochastic search variable selection for log-linear models

We develop a Markov chain Monte Carlo algorithm, based on ‘stochastic search variable selection’ (George and McCuUoch, 1993), for identifying promising log-linear models. The method may be used in the analysis of multi-way contingency tables where the set of plausible models is very large.