删失截断情形下Weibull分布多变点模型的参数估计

通过添加缺失的寿命变量数据,得到了删失截断情形下Weibull分布多变点模型的完全数据似然函数,研究了变点位置参数和形状参数以及尺度参数的满条件分布.利用Gibbs抽样与Metropolis-Hastings算法相结合的MCMC方法得到了参数的Gibbs样本,把Gibbs样本的均值作为各参数的Bayes估计.详细介绍了MCMC方法的实施步骤.随机模拟试验的结果表明各参数Bayes估计的精度都较高.     

基于MCMC方法的ARFIMA模型贝叶斯分析及实证研究

在经济领域中,时间序列具有序列相关和长记忆等特征,用考虑了时间序列短记忆性和长记忆的ARFIMA来模型分析研究经济时间序列有利于提高拟合及预测的精度。近几十年来对ARFIMA模型参数估计和分数差分算子阶数d的研究越来越多,该模型的应用也越来越广泛。基于贝叶斯方法在参数估计中的优越性,本文结合众多应用此方法的文献所得到的后验分布特点,提出了合理的先验分布,考虑到计算难度,采用MCMC方法对模型的参数进行估计,最后应用我国过去几十年的GDP数据进行实证分析,得到了ARFIMA模型参数的后验分布图、均值、方差及95%的置信区间。     

屏蔽数据下指数分布两部件串联系统多变点模型的贝叶斯估计

通过引入潜在变量得到了截尾情形屏蔽数据下指数分布两部件串联系统交点模型较简单的似然函数.利用Gibbs抽样与Metropolis-Hastings算法相结合的MCMC方法对各参数进行了抽样.基于Gibbs样本对参数进行估计.随机模拟的结果表明估计的精度较高.     

固定效应时异系数广义空间自回归模型的估计与模拟

空间面板数据模型常呈现时异特征,现实经济现象中的空间关联多带有时异特性。基于此,本文构建固定效应时异系数广义空间自回归模型,首先采用拟极大似然(QML)方法估计模型并证明参数估计量的渐近性,其次依据贝叶斯(Bayes)公式推出参数后验分布并设计MCMC抽样,最后基于数值模拟比较两种方法在有限样本下的模拟情况,结合具体实例对比分析两种方法的实际估计效果。结果发现:一方面,两种方法的参数模拟均方误差都表现出随样本个体数目的增大而减小,表明增加观测个体数目能显著降低参数模拟偏差。另一方面,Bayes估计的均方误差都小于QML估计,说明Bayes估计比QML估计更可靠。     

Marshall-Olkin威布尔分布的贝叶斯分析（英文）

Kundu与Gupta~([1])提出用重要抽样法来计算Marshal-Olkin两元威布尔分布参数的贝叶斯估计,然而我们发现在样本量变大的情况下,重要抽样算法的参数估计效果却不理想.在这篇文章中,我们引入潜在变量来简化似然函数,并且提出利用MCMC算法实现对该模型未知参数的估计.为了评价我们提出方法的有效性,我们将提出的贝叶斯方法与极大似然估计数据模拟结果作对比,可以发现:即使在样本量很小的情况下,提出的贝叶斯方法的参数估计效果更理想.实例分析也说明了这一点.     

IIRCT下泊松分布参数多变点模型的贝叶斯估计

通过添加缺损的寿命变量数据得到了带有不完全信息随机截尾试验下泊松分布参数多变点模型的完全数据似然函数,研究了变点位置参数和其它参数的满条件分布.利用Gibbs抽样与Metropolis-Hastings算法相结合的MCMC方法对各参数的满条件分布分别进行了抽样,把Gibbs样本的均值作为各参数的贝叶斯估计,并且详细介绍了MCMC方法的实施步骤.最后进行了随机模拟试验,试验结果表明各参数贝叶斯估计的精度都较高.     

左截断右删失数据下离散型寿命失效率变点模型的Bayes参数估计

利用EM算法和MCMC方法得到了左截断右删失数据下离散型寿命失效率变点模型的参数估计.利用筛选法对缺失数据进行填充,对各参数进行Gibbs抽样.随机模拟证实方法可行且参数估计的精度较高.     

因变量缺失下部分线性变系数模型的稳健估计

本文讨论因变量缺失下部分线性变系数模型在误差项和解释变量都含有异常点时的稳健估计问题。首先用局部加权线性光滑方法得到非参数部分的稳健估计,然后再得到参数部分的估计,并证明参数和非参数估计量的渐近正态性。最后模拟研究有限样本下估计量的表现。     

厚尾随机波动率模型的贝叶斯参数估计及实证研究

针对现有时间序列模型难以刻画参数渐变性的问题,对厚尾随机波动(SV)模型的参数估计方法进行了推广,采用基于贝叶斯的MCMC方法,选取2013年5月~2016年6月这一经历多轮震荡的上证指数作为实证分析对象,构造了基于Gibbs抽样的MCMC过程进行仿真分析.结果显示,以卡方分布作为厚尾参数的先验分布能够有效地描述数据波动的厚尾特征,并且能得到较高精度的参数估计结果.结果表明,厚尾SV模型能有效反映出我国股市尖峰厚尾和波动长期记忆性的特征.     

基于Gibbs抽样方法ARFIMA-GARCH模型的贝叶斯估计

近年来,ARMA、GARCH模型的研究一直是金融统计方向研究的热点。但是少有人研究ARFIMA-GARCH模型。因此本文提出ARFuNA(p,d,q)-GARcH(r,s)模型,该模型对r=O,s=O时退化为ARMA类模型,对p=O,q=O,d=O时就退化为GARCH模型,它囊括了时间序列的各种情形的。由于理论和实证表明对各种ARMA、GARCH类模型基于常用分布的似然函数得到的模型估计精度不高,故本文提出了基于贝叶斯方估计的MCMC方法来估计模型参数。这样就充分利用了样本信息和模型参数先验信息,因而具有更小的方差,能得到更精确的估计结果。最后本文以上证综合指数五分钟数据来进行仿真分析,建立了基于MCMC模拟方法的贝叶斯估计的ARFIMA(p,d,q)-GARCH(r,s)模型。数据分析中采用典型的Gibs抽样,基于MCMC模拟1500次,舍弃前100次,得到ARFIMA(1,d,1).GARCH(1,1)各参数的贝叶斯估计,并与传统EVIEWS估计得到的参数相比,发现贝叶斯估计更精确。     

Inference of the stochastic MAPK pathway by modified diffusion bridge method

The MAPK pathway is one of the well-known systems in oncogene researches of eukaryotes due to its important role in cell life. In this study, we perform the parameter estimation of a realistic MAPK system by using western blotting data. In inference, we use the modified diffusion bridge algorithm with data augmentation technique by modelling the realistically complex system via the Euler–Maruyama approximation. This approximation, which is the discretized version of the diffusion model, can be seen as an alternative OR approach with respect to the (hidden) Markov chain method in stochastic modelling of the biochemical systems where the data can be fully or partially observed and the time-course measurements are though to be collected at small time steps. Hereby, the modified diffusion bridge technique, which is based on the Markov Chain Monte Carlo (MCMC) methods, enables us to accurately estimate the model parameters, presented as the stochastic reaction rate constants, of the diffusion model under high dimensional systems despite loss in computational demand. In the estimation of the parameters, due to the complexity in the decision-making problems of the MCMC updates at different stages, we face with the dependency challenges. We unravel them by checking the singularity of the system in every stage of updates. In modelling, we also assume with/without-measurement error approaches in all states. But in order to evaluate the performance of both models, we initially implement them in a toy system. From the results, we observe that the model with measurement error performs better than the model without measurement error in terms of the mixing features of the MCMC runs and the accuracy of estimates, thereby, it is used for the parameter estimation of the realistic MAPK pathway. From the outcomes, we consider that the suggested approach can be seen as a promising alternative method in inference of parameters via different OR techniques in system biology.     

Marshall-Olkin�������ֲ��ı�Ҷ˹����

??Kundu and Gupta proposed to use the importance sampling method to compute the Bayesian estimation of the unknown parameters of the Marshall-Olkin bivariate Weibull distribution. However, we find that the performance of the importance sampling method becomes worse as the sample size gets larger. In this paper, we introduce latent variables to simplify the likelihood function, and use MCMC algorithm to estimate the unknown parameters. Numerical simulations are carried out to assess the performance of the proposed method by comparing with the maximum likelihood estimation, and we find that the Bayesian estimates perform better even for the case of small sample size. A real data is also analyzed for illustrative purpose.     

Adaptive Rejection Metropolis Simulated Annealing for Detecting Global Maximum Regions

A finite mixture model has been used to fit the data from heterogeneous populations to many applications. An Expectation Maximization (EM) algorithm is the most popular method to estimate parameters in a finite mixture model. A Bayesian approach is another method for fitting a mixture model. However, the EM algorithm often converges to the local maximum regions, and it is sensitive to the choice of starting points. In the Bayesian approach, the Markov Chain Monte Carlo (MCMC) sometimes converges to the local mode and is difficult to move to another mode. Hence, in this paper we propose a new method to improve the limitation of EM algorithm so that the EM can estimate the parameters at the global maximum region and to develop a more effective Bayesian approach so that the MCMC chain moves from one mode to another more easily in the mixture model. Our approach is developed by using both simulated annealing (SA) and adaptive rejection metropolis sampling (ARMS). Although SA is a well-known approach for detecting distinct modes, the limitation of SA is the difficulty in choosing sequences of proper proposal distributions for a target distribution. Since ARMS uses a piecewise linear envelope function for a proposal distribution, we incorporate ARMS into an SA approach so that we can start a more proper proposal distribution and detect separate modes. As a result, we can detect the maximum region and estimate parameters for this global region. We refer to this approach as ARMS annealing. By putting together ARMS annealing with the EM algorithm and with the Bayesian approach, respectively, we have proposed two approaches: an EM-ARMS annealing algorithm and a Bayesian-ARMS annealing approach. We compare our two approaches with traditional EM algorithm alone and Bayesian approach alone using simulation, showing that our two approaches are comparable to each other but perform better than EM algorithm alone and Bayesian approach alone. Our two approaches detect the global maximum region well and estimate the parameters in this region. We demonstrate the advantage of our approaches using an example of the mixture of two Poisson regression models. This mixture model is used to analyze a survey data on the number of charitable donations.     

A Hybrid Logistic Model for Case-Control Studies

For logistic regression in case-control studies, when risk factors associated with the outcome are exceedingly rare in the control group, the estimation of parameters in the model becomes difficult. In this paper, we propose a two-stage hybrid method to achieve this. In the first stage, we model the risk due to the rare factor, and in the second stage we model the residual risk due to the other factors using standard logistic model.     

Gamma shared frailty model based on reversed hazard rate for bivariate survival data

The unknown or unobservable risk factors in the survival analysis cause heterogeneity between the individuals. Frailty models are used in the survival analysis to account for the unobserved heterogeneity in the individual risks to disease and death. In this paper, we suggest the shared gamma frailty model with the reversed hazard rate. We introduce the Bayesian estimation procedure using MCMC technique to estimate the parameters involved in the model and compare the frailty model with the baseline model. We apply the proposed models to Australian twin data set and suggest a better model.     

Implementations of the Monte Carlo EM Algorithm

The Monte Carlo EM (MCEM) algorithm is a modification of the EM algorithm where the expectation in the E-step is computed numerically through Monte Carlo simulations. The most exible and generally applicable approach to obtaining a Monte Carlo sample in each iteration of an MCEM algorithm is through Markov chain Monte Carlo (MCMC) routines such as the Gibbs and Metropolis–Hastings samplers. Although MCMC estimation presents a tractable solution to problems where the E-step is not available in closed form, two issues arise when implementing this MCEM routine: (1) how do we minimize the computational cost in obtaining an MCMC sample? and (2) how do we choose the Monte Carlo sample size? We address the first question through an application of importance sampling whereby samples drawn during previous EM iterations are recycled rather than running an MCMC sampler each MCEM iteration. The second question is addressed through an application of regenerative simulation. We obtain approximate independent and identical samples by subsampling the generated MCMC sample during different renewal periods. Standard central limit theorems may thus be used to gauge Monte Carlo error. In particular, we apply an automated rule for increasing the Monte Carlo sample size when the Monte Carlo error overwhelms the EM estimate at any given iteration. We illustrate our MCEM algorithm through analyses of two datasets fit by generalized linear mixed models. As a part of these applications, we demonstrate the improvement in computational cost and efficiency of our routine over alternative MCEM strategies.     

Compound negative binomial shared frailty models for bivariate survival data

In this paper, we introduce a new shared frailty model called the compound negative binomial shared frailty model with three different baseline distributions namely, Weibull, generalized exponential and exponential power distribution. To estimate the parameters involved in these models we adopt Markov Chain Monte Carlo (MCMC) approach. Also we apply these three models to a real life bivariate survival data set of McGrilchrist and Aisbett (1991) related to kidney infection and suggest a better model for the data.     

跳扩散结构下风险最小化动态套期保值策略研究

在标的资产价格服从跳-扩散过程情况下,研究了风险最小化动态套期保值问题.首先用MCMC方法估计得到模型参数值,克服了传统的直接用样本均值和样本方差进行参数估计值的不足,与市场实际更吻合;然后在风险最小目标下,采用逐步倒推法得到随时间改变的动态最优套期保值策略解析表达式,由此可以及时做出策略调整,达到既对冲风险又节约成本的目的.文章最后通过对比分析不同期限、不同策略调整频率情况下的费用投入,得出期限和策略调整频率之间的关系,为套期保值者根据不同情况做出合理的套保策略提供了参考,另外,为满足金融机构进行压力测试或投资者为适应费率调整的需要,也分析说明了不同交易费率和策略之间的关系.     

Sparse Vector Autoregressive Modeling

The vector autoregressive (VAR) model has been widely used for modeling temporal dependence in a multivariate time series. For large (and even moderate) dimensions, the number of the AR coefficients can be prohibitively large, resulting in noisy estimates, unstable predictions, and difficult-to-interpret temporal dependence. To overcome such drawbacks, we propose a two-stage approach for fitting sparse VAR (sVAR) models in which many of the AR coefficients are zero. The first stage selects nonzero AR coefficients based on an estimate of the partial spectral coherence (PSC) together with the use of BIC. The PSC is useful for quantifying the conditional relationship between marginal series in a multivariate process. A refinement second stage is then applied to further reduce the number of parameters. The performance of this two-stage approach is illustrated with simulation and real data examples. Supplementary materials for this article are available online.