A grouped beta process model for multivariate resting‐state EEG microstate analysis on twins

EEG microstate analysis investigates the collection of distinct temporal blocks that characterize the electrical activity of the brain. Brain activity within each microstate is stable, but activity switches rapidly between different microstates in a nonrandom way. We propose a Bayesian nonparametric model that concurrently estimates the number of microstates and their underlying behaviour. We use a Markov switching vector autoregressive (VAR) framework, where a hidden Markov model (HMM) controls the nonrandom state switching dynamics of the EEG activity and a VAR model defines the behaviour of all time points within a given state. We analyze the resting‐state EEG data from twin pairs collected through the Minnesota Twin Family Study, consisting of 70 epochs per participant, where each epoch corresponds to 2 s of EEG data. We fit our model at the twin pair level, sharing information within epochs from the same participant and within epochs from the same twin pair. We capture within twin‐pair similarity, using an Indian buffet process, to consider an infinite library of microstates, allowing each participant to select a finite number of states from this library. The state spaces of highly similar twins may completely overlap while dissimilar twins could select distinct state spaces. In this way, our Bayesian nonparametric model defines a sparse set of states that describe the EEG data. All epochs from a single participant use the same set of states and are assumed to adhere to the same state switching dynamics in the HMM model, enforcing within‐participant similarity.     

Markov switching model of nonlinear autoregressive with skew-symmetric innovations

We consider data generating structures which can be represented as a Markov switching of nonlinear autoregressive model with considering skew-symmetric innovations such that switching between the states is controlled by a hidden Markov chain. We propose semi-parametric estimators for the nonlinear functions of the proposed model based on a maximum likelihood (ML) approach and study sufficient conditions for geometric ergodicity of the process. Also, an Expectation-Maximization type optimization for obtaining the ML estimators are presented. A simulation study and a real world application are also performed to illustrate and evaluate the proposed methodology.     

Markov Regime Switching and Unit-Root Tests

We investigate the power and size performance of unit-root tests when the data undergo Markov regime switching. All tests, including those robust to a single break in trend growth rate, have low power against a process with a Markov-switching trend. Under the null hypothesis, we find that previously documented size distortions in Dickey–Fuller-type tests caused by a single break in trend growth rate or variance do not generalize to most parameterizations of Markov switching in trend or variance. However, Markov switching in variance can lead to overrejection in tests allowing for a single break the level of trend.     

Markov-Switching and Stochastic Volatility Diffusion Models of Short-Term Interest Rates

This article empirically compares the Markov-switching and stochastic volatility diffusion models of the short rate. The evidence supports the Markov-switching diffusion model. Estimates of the elasticity of volatility parameter for single-regime models unanimously indicate an explosive volatility process, whereas the Markov-switching models estimates are reasonable. Itis found that either Markov switching or stochastic volatility, but not both, is needed to adequately fit the data. A robust conclusion is that volatility depends on the level of the short rate. Finally, the Markov-switching model is the best for forecasting. A technical contribution of this article is a presentation of quasi-maximum likelihood estimation techniques for the Markov-switching stochastic-volatility model.     

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.     

ASSESSING AND TESTING FOR THRESHOLD NONLINEARITY IN STOCK RETURNS

This paper proposes a test for threshold nonlinearity in a time series with generalized autore‐gressive conditional heteroscedasticity (GARCH) volatility dynamics. This test is used to examine whether financial returns on market indices exhibit asymmetric mean and volatility around a threshold value, using a double‐threshold GARCH model. The test adopts the reversible‐jump Markov chain Monte Carlo idea of Green, proposed in 1995, to calculate the posterior probabilities for a conventional GARCH model and a double‐threshold GARCH model. Posterior evidence favouring the threshold GARCH model indicates threshold nonlinearity with asymmetric behaviour of the mean and volatility. Simulation experiments demonstrate that the test works very well in distinguishing between the conventional GARCH and the double‐threshold GARCH models. In an application to eight international financial market indices, including the G‐7 countries, clear evidence supporting the hypothesis of threshold nonlinearity is discovered, simultaneously indicating an uneven mean‐reverting pattern and volatility asymmetry around a threshold return value.     

Dynamic Copula-Based Markov Time Series

This article examines a test procedure for checking the constancy of serial dependence via copulas for Markov time series data. It also provides a copula-based modeling approach for the dynamic serial dependence. Various parametric families of copulas offering different dependent structures are investigated. A score test is proposed for checking the constancy of a copula parameter. The score test is constructed and its asymptotic null distribution established under a two-stage estimation procedure. The test does not require specification of the probability distribution for the copula parameter. To capture the dynamics of dependence structure over time, autoregressive moving average and exponential type models are proposed. Illustrations are given based on simulated data and historic coffee prices data.     

An online Bayesian mixture labelling method by minimizing deviance of classification probabilities to reference labels

Solving label switching is crucial for interpreting the results of fitting Bayesian mixture models. The label switching originates from the invariance of posterior distribution to permutation of component labels. As a result, the component labels in Markov chain simulation may switch to another equivalent permutation, and the marginal posterior distribution associated with all labels may be similar and useless for inferring quantities relating to each individual component. In this article, we propose a new simple labelling method by minimizing the deviance of the class probabilities to a fixed reference labels. The reference labels can be chosen before running Markov chain Monte Carlo (MCMC) using optimization methods, such as expectation-maximization algorithms, and therefore the new labelling method can be implemented by an online algorithm, which can reduce the storage requirements and save much computation time. Using the Acid data set and Galaxy data set, we demonstrate the success of the proposed labelling method for removing the labelling switching in the raw MCMC samples.     

Bayesian analysis of single-molecule experimental data

Summary.  Recent advances in experimental technologies allow scientists to follow biochemical processes on a single-molecule basis, which provides much richer information about chemical dynamics than traditional ensemble-averaged experiments but also raises many new statistical challenges. The paper provides the first likelihood-based statistical analysis of the single-molecule fluorescence lifetime experiment designed to probe the conformational dynamics of a single deoxyribonucleic acid (DNA) hairpin molecule. The conformational change is initially treated as a continuous time two-state Markov chain, which is not observable and must be inferred from changes in photon emissions. This model is further complicated by unobserved molecular Brownian diffusions. Beyond the simple two-state model, a competing model that models the energy barrier between the two states of the DNA hairpin as an Ornstein–Uhlenbeck process has been suggested in the literature. We first derive the likelihood function of the simple two-state model and then generalize the method to handle complications such as unobserved molecular diffusions and the fluctuating energy barrier. The data augmentation technique and Markov chain Monte Carlo methods are developed to sample from the posterior distribution desired. The Bayes factor calculation and posterior estimates of relevant parameters indicate that the fluctuating barrier model fits the data better than the simple two-state model.     

Efficient estimation of Markov regime-switching models: An application to electricity spot prices

In this paper we discuss the calibration of models built on mean-reverting processes combined with Markov regime-switching (MRS). We propose a method that greatly reduces the computational burden induced by the introduction of independent regimes and perform a simulation study to test its efficiency. Our method allows for a 100 to over 1000 times faster calibration than in case of a competing approach utilizing probabilities of the last 10 observations. It is also more general and admits any value of γ in the base regime dynamics. Since the motivation for this research comes from a recent stream of literature in energy economics, we apply the new method to sample series of electricity spot prices from the German EEX and Australian NSW markets. The proposed MRS models fit these datasets well and replicate the major stylized facts of electricity spot price dynamics.     

Markov switching component GARCH model: Stability and forecasting

ABSTRACT

This paper introduces an extension of the Markov switching GARCH model where the volatility in each state is a convex combination of two different GARCH components with time varying weights. This model has the dynamic behavior to capture the variants of shocks. The asymptotic behavior of the second moment is investigated and an appropriate upper bound for it is evaluated. Using the Bayesian method via Gibbs sampling algorithm, a dynamic method for the estimation of the parameters is proposed. Finally, we illustrate the efficiency of the model by simulation and also by considering two different set of empirical financial data. We show that this model provides much better forecasts of the volatility than the Markov switching GARCH model.     

基于马尔可夫转换模型的违约风险溢价预测研究

针对违约风险溢价变化依赖于经济波动状态以及市场、宏观经济变量依赖于经济周期时变因素的阶段,基于马尔可夫转换阶段的具体特征,构建马尔可夫违约风险溢价预测转换模型,并以香港恒生指数信用违约互换波动为例,测算因时变系数波动的指数息差、宏观经济变量等概率,通过实证算例剖析股市、宏观经济变量与违约风险溢价之间的内在联动关系和信用违约风险溢价变化的转换机制,以期实现对违约风险溢价能够进行有效预测,实证仿真结果说明了模型的有效性。     

Trends in smoking cessation: a Markov model approach

Intervention trials such as studies on smoking cessation may observe multiple, discrete outcomes over time. When the outcome is binary, participant observations may alternate between two states over the course of the study. The generalized estimating equation (GEE) approach is commonly used to analyze binary, longitudinal data in the context of independent variables. However, the sequence of observations may be assumed to follow a Markov chain with stationary transition probabilities when observations are made at fixed time points. Participants favoring the transition to one particular state over the other would be evidence of a trend in the observations. Using a log-transformed trend parameter, the determinants of a trend in a binary, longitudinal study may be evaluated by maximizing the likelihood function. A new methodology is presented here to test for the presence and determinants of a trend in binary, longitudinal observations. Empirical studies are evaluated and comparisons are made with the GEE approach. Practical application of the proposed method is made to the data available from an intervention study on smoking cessation.     

Markov zero-inflated Poisson regression models for a time series of counts with excess zeros

This paper discusses a class of Markov zero-inflated Poisson regression models for a time series of counts with the presence of excess zero relative to a Poisson distribution, in which the frequency distribution changes according to an underlying two-state Markov chain. Features of the proposed model, estimation method based on the EM and quasi-Newton algorithms, and other implementation issues are discussed. A Monte Carlo study shows that the estimation method is accurate and reliable as long as the sample size is reasonably large, and the choice of starting probabilities for the Markov process has little impact on the parameter estimates. The methodology is illustrated using daily numbers of phone calls reporting faults for a mainframe computer system.     

Relabelling in Bayesian mixture models by pivotal units

Label switching is a well-known and fundamental problem in Bayesian estimation of finite mixture models. It arises when exploring complex posterior distributions by Markov Chain Monte Carlo (MCMC) algorithms, because the likelihood of the model is invariant to the relabelling of mixture components. If the MCMC sampler randomly switches labels, then it is unsuitable for exploring the posterior distributions for component-related parameters. In this paper, a new procedure based on the post-MCMC relabelling of the chains is proposed. The main idea of the method is to perform a clustering technique on the similarity matrix, obtained through the MCMC sample, whose elements are the probabilities that any two units in the observed sample are drawn from the same component. Although it cannot be generalized to any situation, it may be handy in many applications because of its simplicity and very low computational burden.     

A two-state regime switching autoregressive model with an application to river flow analysis

We propose a regime switching autoregressive model and apply it to analyze daily water discharge series of River Tisza in Hungary. The dynamics is governed by two regimes, along which both the autoregressive coefficients and the innovation distributions are altering, moreover, the hidden regime indicator process is allowed to be non-Markovian. After examining stationarity and basic properties of the model, we turn to its estimation by Markov Chain Monte Carlo (MCMC) methods and propose two algorithms. The values of the latent process serve as auxiliary parameters in the first one, while the change points of the regimes do the same in the second one in a reversible jump MCMC setting. After comparing the mixing performance of the two methods, the model is fitted to the water discharge data. Simulations show that it reproduces the important features of the water discharge series such as the highly skewed marginal distribution and the asymmetric shape of the hydrograph.     

A stationarity test on Markov chain models based on marginal distribution

A stationarity test on Markov chain models is proposed in this paper. Most of the previous test procedures for the Markov chain models have been done based on the conditional probabilities of a transition matrix. The likelihood ratio and Pearson type chi-square tests have been used for testing stationarity and order of Markov chains. This paper uses the efficient score test, an extension of the test developed by Tsiatis (1980) [18], for testing the stationarity of Markov chain models based on the marginal distribution as obtained by Azzalini (1994) [2]. For testing the suitability of the proposed method, a numerical example of real life data and simulation studies for comparison with an alternative test procedure are given.     

Reversible jump and the label switching problem in hidden Markov models

Reversible jump Markov chain Monte Carlo (RJMCMC) algorithms can be efficiently applied in Bayesian inference for hidden Markov models (HMMs), when the number of latent regimes is unknown. As for finite mixture models, when priors are invariant to the relabelling of the regimes, HMMs are unidentifiable in data fitting, because multiple ways to label the regimes can alternate during the MCMC iterations; this is the so-called label switching problem. HMMs with an unknown number of regimes are considered here and the goal of this paper is the comparison, both applied and theoretical, of five methods used for tackling label switching within a RJMCMC algorithm; they are: post-processing, partial reordering, permutation sampling, sampling from a Markov prior and rejection sampling. The five strategies we compare have been proposed mostly in the literature of finite mixture models and only two of them, i.e. rejection sampling and partial reordering, have been presented in RJMCMC algorithms for HMMs. We consider RJMCMC algorithms in which the parameters are updated by Gibbs sampling and the dimension of the model changes in split-and-merge and birth-and-death moves. Finally, an example illustrates and compares the five different methodologies.     

Markov Chain Markov Field dynamics: Models and statistics

This study deals with time dynamics of Markov fields defined on a finite set of sites with state space <$>E<$>, focussing on Markov Chain Markov Field (MCMF) evolution. Such a model is characterized by two families of potentials: the instantaneous interaction potentials, and the time delay potentials. Four models are specified: auto-exponential dynamics (<$>E = {\of R}^+<$>), auto-normal dynamics (<$>E = {\of R}<$>), auto-Poissonian dynamics (<$>E = {\of N}<$>) and auto-logistic dynamics ( E qualitative and finite). Sufficient conditions ensuring ergodicity and strong law of large numbers are given by using a Lyapunov criterion of stability, and the conditional pseudo-likelihood statistics are summarized. We discuss the identification procedure of the two Markovian graphs and look for validation tests using martingale central limit theorems. An application to meteorological data illustrates such a modelling.     

Relabelling algorithms for mixture models with applications for large data sets

Mixture models are flexible tools in density estimation and classification problems. Bayesian estimation of such models typically relies on sampling from the posterior distribution using Markov chain Monte Carlo. Label switching arises because the posterior is invariant to permutations of the component parameters. Methods for dealing with label switching have been studied fairly extensively in the literature, with the most popular approaches being those based on loss functions. However, many of these algorithms turn out to be too slow in practice, and can be infeasible as the size and/or dimension of the data grow. We propose a new, computationally efficient algorithm based on a loss function interpretation, and show that it can scale up well in large data set scenarios. Then, we review earlier solutions which can scale up well for large data set, and compare their performances on simulated and real data sets. We conclude with some discussions and recommendations of all the methods studied.