隐Markov模型的强马氏性

引入隐Markov模型强马氏性的概念,并进一步研究了隐Markov模型在强马氏性方面的一些性质.     

可列非齐次隐Markov模型的强大数定律

隐马尔科夫模型被广泛的应用于弱相依随机变量的建模,是研究神经生理学、发音过程和生物遗传等问题的有力工具。研究了可列非齐次隐 Markov 模型的若干性质,得到了这类模型的强大数定律,推广了有限非齐次马氏链的一类强大数定律。     

经2状态马氏修正的Poisson过程的极大似然估计

近年来。隐马氏模型成为研究相依随机变量的一个十分有用的工具。应用过程中的一个很重要的问题是如何对隐马氏模型的参数进行估计。一般使用的方法是将连续时间隐马氏模型的问题转化为离散时间隐马氏模型的问题来讨论。本文用此方法讨论一类连续时间隐马氏模型——状态个数为2的经马氏链修正的Poisson过程的极大似然估计及其算法。此类模型被广泛用来对复杂通信网络的通信流进行建模。     

BA模型的数学基础——纪念李国平院士吴新谋教授诞辰100周年

该文基于马氏链的概念和技巧, 给出了BA无标度网络模型稳态度分布存在性的严格证明, 并且从数学上重新推导了度分布的精确解析表达式. 此处所用的方法具有一定的普适性, 适用于更一般的无标度型复杂网络模型.     

马氏环境下的一类离散风险模型

文章主要讨论了马氏环境下的一类离散风险模型，其中在任意单位时间区间内的索赔情况由一三个状态的平稳马尔科夫链{Ik≥0）决定：Ik=0时，则第k个单位时间区间内没有索赔；Ik=1时，则发生一次X类索赔；Ik=2时，则发生一次Y类索赔．对此模型给出了条件破产概率的递推公式及某一特殊条件下的最终破产概率的上界．     

隐半马尔科夫市场下投资组合的动态决策问题（英文）

在长期投资组合中,既要考虑金融资产自身的价格波动风险,又要关注宏观经济环境变化及通胀风险对各资产的影响.为此,本文建立宏观经济环境服从隐半马尔科夫链的金融市场,由通胀指数债券、银行存款和普通股票构成投资组合.由期望效用最大化构建随机控制模型,考虑到该隐半马尔科夫市场的不完备性,进一步将该投资组合问题视作部分信息的随机控制问题,并利用隐半马尔科夫滤波将部分信息控制问题转化问完全信息问题,得到解的存在唯一性.本文最后给出若干数值模拟结果,结果显示本文建立的模型优于普通市场的模型.     

基于HMM的CpG岛位置判别

隐马尔科夫过程是20世纪70年代提出来的一种统计方法,以前主要用于语音识别,1989年Churchill将其引入计算生物学,目前HMM是生物信息学中应用比较广泛的统计方法。本文对马尔科夫过程和HMM进行了简明扼要的描述,并对其在CpG岛位置判别中的应用做了概括介绍。     

马氏环境中马氏链泛函的中心极限定理

讨论了具有离散参数的马氏环境中马氏链的性质,建立了马氏环境中马氏链泛函的中心极限定理.同时给出了加在链和过程样本函数上的充分条件.     

基于灰色马尔科夫链预测模型的广西边境小额贸易预测研究——灰色系统理论应用系列论文之三

在分析广西边境小额贸易现状的基础上,运用灰色模型和马尔科夫链的基本理论,构建灰色马尔科夫模型进行了预测.结果表明,经过二阶弱化处理、灰色建模、灰色新陈代谢以及灰色马尔科夫预测的结果,能明显地提高预测精度.最后,提出了加大基础设施建设、转变边贸流通模式、构建沿边型产业开放体系、提高边境贸易便利化水平和培育发展边境特色经济带等对策建议.     

基于动态规划的高阶隐马氏模型推广的Viterbi算法

首先通过Hadar等价变换方法将高阶隐马氏模型转换为与之等价的一阶向量值隐马氏模型,然后利用动态规划原理建立了一阶向量值隐马氏模型的Viterbi算法,最后通过高阶隐马氏模型和一阶向量值隐马氏模型之间的等价关系建立了高阶隐马氏模型基于动态规划推广的Viterbi算法．研究结果在一定程度上推广了几乎所有隐马氏模型文献中所涉及到的解码问题的Viterbi算法,从而进一步丰富和发展了高阶隐马氏模型的算法理论．     

������ɷ��Ԫ��̬�ֲ������ļ�����Ȼ����

??Hidden Markov model is widely used in statistical modeling of time, space and state transition data. The definition of hidden Markov multivariate normal distribution is given. The principle of using cluster analysis to determine the hidden state of observed variables is introduced. The maximum likelihood estimator of the unknown parameters in the model is derived. The simulated observation data set is used to test the estimation effect and stability of the method. The characteristic is simple classical statistical inference such as cluster analysis and maximum likelihood estimation. The method solves the parameter estimation problem of complex statistical models.     

Maximum Likelihood Estimation of Hidden Markov Multivariate Normal Distribution Parameters

Hidden Markov model is widely used in statistical modeling of time, space and state transition data. The definition of hidden Markov multivariate normal distribution is given. The principle of using cluster analysis to determine the hidden state of observed variables is introduced. The maximum likelihood estimator of the unknown parameters in the model is derived. The simulated observation data set is used to test the estimation effect and stability of the method. The characteristic is simple classical statistical inference such as cluster analysis and maximum likelihood estimation. The method solves the parameter estimation problem of complex statistical models.     

Ergodic and adaptive control of hidden Markov models

A partially observed stochastic system is described by a discrete time pair of Markov processes. The observed state process has a transition probability that is controlled and depends on a hidden Markov process that also can be controlled. The hidden Markov process is completely observed in a closed set, which in particular can be the empty set and only observed through the other process in the complement of this closed set. An ergodic control problem is solved by a vanishing discount approach. In the case when the transition operators for the observed state process and the hidden Markov process depend on a parameter and the closed set, where the hidden Markov process is completely observed, is nonempty and recurrent an adaptive control is constructed based on this family of estimates that is almost optimal.     

An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure

Although the concept of Batch Markovian Arrival Processes (BMAPs) has gained widespread use in stochastic modelling of communication systems and other application areas, there are few statistical methods of parameter estimation proposed yet. However, in order to practically use BMAPs for modelling, statistical model fitting from empirical time series is an essential task. The present paper contains a specification of the classical EM algorithm for MAPs and BMAPs as well as a performance comparison to the computationally simpler estimation procedure recently proposed by Breuer and Gilbert. Furthermore, it is shown how to adapt the latter to become an estimator for hidden Markov models.     

Basic problems solving for two-dimensional discrete 3 × 4 order hidden markov model

A novel model is proposed to overcome the shortages of the classical hypothesis of the two-dimensional discrete hidden Markov model. In the proposed model, the state transition probability depends on not only immediate horizontal and vertical states but also on immediate diagonal state, and the observation symbol probability depends on not only current state but also on immediate horizontal, vertical and diagonal states. This paper defines the structure of the model, and studies the three basic problems of the model, including probability calculation, path backtracking and parameters estimation. By exploiting the idea that the sequences of states on rows or columns of the model can be seen as states of a one-dimensional discrete 1 × 2 order hidden Markov model, several algorithms solving the three questions are theoretically derived. Simulation results further demonstrate the performance of the algorithms. Compared with the two-dimensional discrete hidden Markov model, there are more statistical characteristics in the structure of the proposed model, therefore the proposed model theoretically can more accurately describe some practical problems.     

隐非齐次马尔可夫模型的强大数定律

在状态集都有限的情况下,给出了隐马尔可夫模型的一些性质定理．利用马氏链的强极限定理,得到了隐非齐次马尔可夫模型的强大数定律．     

Estimating Hidden Semi-Markov Chains From Discrete Sequences

This article addresses the estimation of hidden semi-Markov chains from nonstationary discrete sequences. Hidden semi-Markov chains are particularly useful to model the succession of homogeneous zones or segments along sequences. A discrete hidden semi-Markov chain is composed of a nonobservable state process, which is a semi-Markov chain, and a discrete output process. Hidden semi-Markov chains generalize hidden Markov chains and enable the modeling of various durational structures. From an algorithmic point of view, a new forward-backward algorithm is proposed whose complexity is similar to that of the Viterbi algorithm in terms of sequence length (quadratic in the worst case in time and linear in space). This opens the way to the maximum likelihood estimation of hidden semi-Markov chains from long sequences. This statistical modeling approach is illustrated by the analysis of branching and flowering patterns in plants.     

A Markov-modulated model for stocks paying discrete dividends

We extend the model in [Korn, R., Rogers, L.C.G., 2005. Stock paying discrete dividends: modelling and option pricing. Journal of Derivatives 13, 44–49] for (discrete) dividend processes to incorporate the dependence of assets on the market mode or the state of the economy, where the latter is modeled by a hidden finite-state Markov chain. We then derive the resulting dynamics of the stock price and various option-pricing formulae. It turns out that the stock price jumps not only at the time of the dividend payment, but also when the underlying Markov chain jumps.     

Filtering and change point estimation for hidden Markov-modulated Poisson processes

A continuous-time Markov chain which is partially observed in Poisson noise is considered, where a structural change in the dynamics of the hidden process occurs at a random change point. Filtering and change point estimation of the model is discussed. Closed-form recursive estimates of the conditional distribution of the hidden process and the random change point are obtained, given the Poisson process observations