Markov switch smooth transition HYGARCH model: Stability and estimation

Abstract

HYGARCH model is basically used to model long-range dependence in volatility. We propose Markov switch smooth-transition HYGARCH model, where the volatility in each state is a time-dependent convex combination of GARCH and FIGARCH. This model provides a flexible structure to capture different levels of volatilities and also short and long memory effects. The necessary and sufficient condition for the asymptotic stability is derived. Forecast of conditional variance is studied by using all past information through a parsimonious way. Bayesian estimations based on Gibbs sampling are provided. A simulation study has been given to evaluate the estimations and model stability. The competitive performance of the proposed model is shown by comparing it with the HYGARCH and smooth-transition HYGARCH models for some period of the S&P500 and Dow Jones industrial average indices based on volatility and value-at-risk forecasts.     

Regime-switching pure jump processes and applications in the valuation of mortality-linked products

In this paper, we study the pricing of longevity bonds and an insurance contract on multiple lives in a regime-switching market driven by an underlying continuous-time Markov chain. For modeling dependent mortality, we make use of a Markov chain and some shot noise processes with regime switching. By using a martingale method, we give semi-analytical expressions for the price of longevity bonds and the premium of an insurance contract on the kth person to die.     

Economic design of quick switching sampling system for assuring Weibull distributed mean life

In this paper, we propose the quick switching sampling system for assuring mean life of a product under time truncated life test where the lifetime of the product follows the Weibull distribution and the mean life is considered as the quality of the product. The optimal parameters of the proposed system are determined using two points on the operating characteristic curve approach for various combinations of consumer's risk and ratio of true mean life time and specified life time. Tables are constructed to determine the optimal parameters for specified acceptable quality level and limiting quality level along with the corresponding probabilities of acceptance. The proposed system is compared with other existing sampling plans under Weibull lifetime model. In addition, an economical design of the proposed system is also discussed.     

Designing and selection of two-plan variables scheme indexed by crossover point

In this paper, the scheme of the inspection plan, namely the tightened normal tightened (n_T, n_N; k) is considered and procedures and necessary tables are developed for the selection of the variables sampling scheme, indexed through crossover point (COP). The importance of COP, the properties and advantages of the operating characteristic curve with respect to COP are studied.     

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.     

语码转换的功能分析

运用系统功能语言学的理论分析语码转换现象的人际功能和语篇功能。语码转换作为一种特殊的交际策略,在使用中有着多种微妙的人际功能,并且能起到诸如引起话题、衔接连贯、突出焦点信息等功能。     

双复层不锈复合钢板的焊接性能试验研究

针对新型材料双复层不锈复合钢板进行了焊接性能试验研究，试验结果为该钢板的工程应用提供参考依据。     

A Simple Solution to Bayesian Mixture Labeling

The label-switching problem is one of the fundamental problems in Bayesian mixture analysis. Using all the Markov chain Monte Carlo samples as the initials for the expectation-maximization (EM) algorithm, we propose to label the samples based on the modes they converge to. Our method is based on the assumption that the samples converged to the same mode have the same labels. If a relative noninformative prior is used or the sample size is large, the posterior will be close to the likelihood and then the posterior modes can be located approximately by the EM algorithm for mixture likelihood, without assuming the availability of the closed form of the posterior. In order to speed up the computation of this labeling method, we also propose to first cluster the samples by K-means with a large number of clusters K. Then, by assuming that the samples within each cluster have the same labels, we only need to find one converged mode for each cluster. Using a Monte Carlo simulation study and a real dataset, we demonstrate the success of our new method in dealing with the label-switching problem.     

Optimal Forecasts from Markov Switching Models

We derive forecasts for Markov switching models that are optimal in the mean square forecast error (MSFE) sense by means of weighting observations. We provide analytic expressions of the weights conditional on the Markov states and conditional on state probabilities. This allows us to study the effect of uncertainty around states on forecasts. It emerges that, even in large samples, forecasting performance increases substantially when the construction of optimal weights takes uncertainty around states into account. Performance of the optimal weights is shown through simulations and an application to U.S. GNP, where using optimal weights leads to significant reductions in MSFE. Supplementary materials for this article are available online.     

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.