Perfect simulation of conditionally specified models

We discuss how the ideas of producing perfect simulations based on coupling from the past for finite state space models naturally extend to multivariate distributions with infinite or uncountable state spaces such as auto-gamma, auto-Poisson and autonegative binomial models, using Gibbs sampling in combination with sandwiching methods originally introduced for perfect simulation of point processes.     

Matrix-analytic Models and their Analysis

We survey phase-type distributions and Markovian point processes, aspects of how to use such models in applied probability calculations and how to fit them to observed data. A phase-type distribution is defined as the time to absorption in a finite continuous time Markov process with one absorbing state. This class of distributions is dense and contains many standard examples like all combinations of exponential in series/parallel. A Markovian point process is governed by a finite continuous time Markov process (typically ergodic), such that points are generated at a Poisson intensity depending on the underlying state and at transitions; a main special case is a Markov-modulated Poisson process. In both cases, the analytic formulas typically contain matrix-exponentials, and the matrix formalism carried over when the models are used in applied probability calculations as in problems in renewal theory, random walks and queueing. The statistical analysis is typically based upon the EM algorithm, viewing the whole sample path of the background Markov process as the latent variable.     

Estimating models based on Markov jump processes given fragmented observation series

We consider the problem of estimating the rate matrix governing a finite-state Markov jump process given a number of fragmented time series. We propose to concatenate the observed series and to employ the emerging non-Markov process for estimation. We describe the bias arising if standard methods for Markov processes are used for the concatenated process, and provide a post-processing method to correct for this bias. This method applies to discrete-time Markov chains and to more general models based on Markov jump processes where the underlying state process is not observed directly. This is demonstrated in detail for a Markov switching model. We provide applications to simulated time series and to financial market data, where estimators resulting from maximum likelihood methods and Markov chain Monte Carlo sampling are improved using the presented correction.     

Goodness‐of‐Fit based on Downsampling with Applications to Linear Drift Diffusions

Abstract. A goodness‐of‐fit test for continuous‐time models is developed that examines if the parameter estimates are consistent with another for different sampling frequencies. The test compares parameter estimates obtained from estimating functions for downsamples of the data. We prove asymptotic results for stationary and ergodic processes, and apply the downsampling test to linear drift diffusions. Simulations indicate that the test is quite powerful in detecting non‐Markovian deviations from the linear drift diffusions.     

Discrete-time survival analysis under ranked set sampling: an application to Turkish motor insurance data

Survival models with continuous-time data are still superior methods of survival analysis. However when the survival data is discrete, taking it as continuous leads the researchers to incorrect results and interpretations. The discrete-time survival model has some advantages in applications such as it can be used for non-proportional hazards, time-varying covariates and tied observations. However, it has a disadvantage about the reconstruction of the survival data and working with big data sets. Actuaries are often rely on complex and big data whereas they have to be quick and efficient for short period analysis. Using the mass always creates inefficient processes and consumes time. Therefore sampling design becomes more and more important in order to get reliable results. In this study, we take into account sampling methods in discrete-time survival model using a real data set on motor insurance. To see the efficiency of the proposed methodology we conducted a simulation study.     

AN ALGORITHM FOR CHOOSING THE SAMPLING TIMES FOR AN EXPERIMENT ON A CONTINUOUS PROCESS

Saunders & Eccleston (1992) and Saunders, Eccleston & Spessa (1992) developed an approach to the design of factorial experiments on continuous processes that allows for the correlation present in such processes. Their methods concentrated on identifying the order of application of treatments in such experiments, assuming that the spacing between experiments is constant. On a continuous process, there is no necessity to maintain equally spaced sampling times. This paper gives an algorithm for choosing the optimal sampling times for a factorial experiment aimed at estimating a particular parameter or set of parameters. It is shown that in practical situations the optimal sampling times give considerable improvements in the accuracy of the parameter estimates.     

Generalized Weibull Linear Models

For the first time, a new class of generalized Weibull linear models is introduced to be competitive to the well-known generalized (gamma and inverse Gaussian) linear models which are adequate for the analysis of positive continuous data. The proposed models have a constant coefficient of variation for all observations similar to the gamma models and may be suitable for a wide range of practical applications in various fields such as biology, medicine, engineering, and economics, among others. We derive a joint iterative algorithm for estimating the mean and dispersion parameters. We obtain closed form expressions in matrix notation for the second-order biases of the maximum likelihood estimates of the model parameters and define bias corrected estimates. The corrected estimates are easily obtained as vectors of regression coefficients in suitable weighted linear regressions. The practical use of the new class of models is illustrated in one application to a lung cancer data set.     

Estimation for Continuous Branching Processes

The maximum-likelihood estimator for the curved exponential family given by continuous branching processes with immigration is investigated. These processes originated from population biology but also model the dynamics of interest rates and development of the state of technology in economics. It is proved that in contrast to branching processes with discrete space and/or time the MLE gives a unified approach to the inference. In order to include singular subdomains of the parameter space we modify the MLE slightly. Consistency and asymptotic normality for the MLE are considered. Concerning the asymptotic theory of the experiments, all three properties LAQ, LAN, and LAMN occur for different submodels     

Bayesian Nonparametric Hidden Markov Models with application to the analysis of copy-number-variation in mammalian genomes

We consider the development of Bayesian Nonparametric methods for product partition models such as Hidden Markov Models and change point models. Our approach uses a Mixture of Dirichlet Process (MDP) model for the unknown sampling distribution (likelihood) for the observations arising in each state and a computationally efficient data augmentation scheme to aid inference. The method uses novel MCMC methodology which combines recent retrospective sampling methods with the use of slice sampler variables. The methodology is computationally efficient, both in terms of MCMC mixing properties, and robustness to the length of the time series being investigated. Moreover, the method is easy to implement requiring little or no user-interaction. We apply our methodology to the analysis of genomic copy number variation.     

Spatiotemporal prediction for log-Gaussian Cox processes

Space–time point pattern data have become more widely available as a result of technological developments in areas such as geographic information systems. We describe a flexible class of space–time point processes. Our models are Cox processes whose stochastic intensity is a space–time Ornstein–Uhlenbeck process. We develop moment-based methods of parameter estimation, show how to predict the underlying intensity by using a Markov chain Monte Carlo approach and illustrate the performance of our methods on a synthetic data set.     

Reversible jump, birth-and-death and more general continuous time Markov chain Monte Carlo samplers

Summary. Reversible jump methods are the most commonly used Markov chain Monte Carlo tool for exploring variable dimension statistical models. Recently, however, an alternative approach based on birth-and-death processes has been proposed by Stephens for mixtures of distributions. We show that the birth-and-death setting can be generalized to include other types of continuous time jumps like split-and-combine moves in the spirit of Richardson and Green. We illustrate these extensions both for mixtures of distributions and for hidden Markov models. We demonstrate the strong similarity of reversible jump and continuous time methodologies by showing that, on appropriate rescaling of time, the reversible jump chain converges to a limiting continuous time birth-and-death process. A numerical comparison in the setting of mixtures of distributions highlights this similarity.     

A Semi-parametric Bayesian Analysis of Survival Data Based on Lévy-driven Processes

In the presence of covariate information, the proportional hazards model is one of the most popular models. In this paper, in a Bayesian nonparametric framework, we use a Markov (Lévy-driven) process to model the baseline hazard rate. Previous Bayesian nonparametric models have been based on neutral to the right processes, which have a number of drawbacks, such as discreteness of the cumulative hazard function. We allow the covariates to be time dependent functions and develop a full posterior analysis via substitution sampling. A detailed illustration is presented.     

A Monte Carlo Markov chain algorithm for a class of mixture time series models

This article generalizes the Monte Carlo Markov Chain (MCMC) algorithm, based on the Gibbs weighted Chinese restaurant (gWCR) process algorithm, for a class of kernel mixture of time series models over the Dirichlet process. This class of models is an extension of Lo’s (Ann. Stat. 12:351–357, 1984) kernel mixture model for independent observations. The kernel represents a known distribution of time series conditional on past time series and both present and past latent variables. The latent variables are independent samples from a Dirichlet process, which is a random discrete (almost surely) distribution. This class of models includes an infinite mixture of autoregressive processes and an infinite mixture of generalized autoregressive conditional heteroskedasticity (GARCH) processes.     

Density regression using repulsive distributions

Flexible regression is a traditional motivation for the development of non-parametric Bayesian models. A popular approach for this involves a joint model for responses and covariates, from which the desired result arises by conditioning on the covariates. Many such models involve the convolution of a continuous kernel with some discrete random probability measure defined as an infinite mixture of i.i.d. atoms. Following this strategy, we propose a flexible model that involves the concept of repulsion between atoms. We show that this results in a more parsimonious representation of the regression than the i.i.d. counterpart. The key aspect is that repulsion discourages mixture components that are near each other, thus favouring parsimony. We show that the conditional model retains the repulsive features, thus facilitating interpretation of the resulting flexible regression, and with little or no sacrifice of model fit compared to the infinite mixture case. We show the utility of the methodology by way of a small simulation study and an application to a well-known data set.     

Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration

Abstract

In this paper, we show how the time for convergence to stationarity of a Markov chain can be assessed using the Wasserstein metric, rather than the usual choice of total variation distance. The Wasserstein metric may be more easily applied in some applications, particularly those on continuous state spaces. Bounds on convergence time are established by considering the number of iterations required to approximately couple two realizations of the Markov chain to within ε tolerance. The particular application considered is the use of the Gibbs sampler in the Bayesian restoration of a degraded image, with pixels that are a continuous grey-scale and with pixels that can only take two colours. On finite state spaces, a bound in the Wasserstein metric can be used to find a bound in total variation distance. We use this relationship to get a precise O(N log N) bound on the convergence time of the stochastic Ising model that holds for appropriate values of its parameter as well as other binary image models. Our method employing convergence in the Wasserstein metric can also be applied to perfect sampling algorithms involving coupling from the past to obtain estimates of their running times.     

Combined continuous lot by lot acceptance sampling plan

For production processes involving low fraction non-conforming, the sample sizes of the usual attribute inspection plans are very large. A continuous sampling plan for such processes would also require either a large clearance interval or a large sampling fraction. This paper simplifies the approach of combining the lot by lot and continuous sampling plans recommended by Pesotchinsky (1987) and provides various performance measures for the combined plan. A discussion of the choice of the parameters is also given.     

Large Deviations for Empirical Estimators of the Stationary Distribution of a Semi-Markov Process with Finite State Space

We prove the large deviation principle for empirical estimators of stationary distributions of semi-Markov processes with finite state space, irreducible embedded Markov chain, and finite mean sojourn time in each state. We consider on/off Gamma sojourn processes as an illustrative example, and, in particular, continuous time Markov chains with two states. In the second case, we compare the rate function in this article with the known rate function concerning another family of empirical estimators of the stationary distribution.     

Non-Gaussian Ornstein–Uhlenbeck-based models and some of their uses in financial economics

Non-Gaussian processes of Ornstein–Uhlenbeck (OU) type offer the possibility of capturing important distributional deviations from Gaussianity and for flexible modelling of dependence structures. This paper develops this potential, drawing on and extending powerful results from probability theory for applications in statistical analysis. Their power is illustrated by a sustained application of OU processes within the context of finance and econometrics. We construct continuous time stochastic volatility models for financial assets where the volatility processes are superpositions of positive OU processes, and we study these models in relation to financial data and theory.     

Feedback and Mediation in Causal Inference Illustrated by Stochastic Process Models

The concept of causality is naturally related to processes developing over time. Central ideas of causal inference like time‐dependent confounding (feedback) and mediation should be viewed as dynamic concepts. We shall study these concepts in the context of simple dynamic systems. Time‐dependent confounding and its implications are illustrated in a Markov model. We emphasize the distinction between average treatment effect, ATE, and treatment effect of the treated, ATT. These effects could be quite different, and we discuss the relationship between them. Mediation is studied in a stochastic differential equation model. A type of natural direct and indirect effects is considered for this model. Mediation analysis of discrete measurements from such processes may give misleading results, and one needs to consider the underlying continuous process. The dynamic and time‐continuous view of causality and mediation is an essential feature, and more attention should be payed to the time aspect in causal inference.     

Average outgoing quality of CSP-C continuous sampling plan under short run production processes

A CSP-C continuous sampling plan is a new single-level continuous sampling procedure developed by Govindaraju & Kandasamy (2000) by incorporating the concept of acceptance number to the CSP-1 plan for the application of continuous production processes. In this new plan, the sampling inspection phase is characterized by a maximum allowable number of non-conforming units, c, and a constant sampling rate, f. Govindaraju & Kandasamy (2000) derived the performance measures such as average outgoing quality (AOQ), average fraction inspected (AFI) etc, of the CSP-C plan using a Markov chain model for long run production processes. Yang (1983) has observed that the AOQ and AFI, being long run average measures, are not satisfactory measures of performance for short run production processes. Hence, formulas are derived in this paper, using the renewal theory approach enabling one to compute AOQ and AFI for both long run and short run production processes. Numerical illustrations are also given. By simulation, the accuracy of the short run measures is studied.