Markov Properties for Acyclic Directed Mixed Graphs

We consider acyclic directed mixed graphs, in which directed edges ( x → y ) and bi-directed edges ( x ↔ y ) may occur. A simple extension of Pearl's d -separation criterion, called m -separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m -separation criterion for arbitrary distributions.     

Conditional Likelihood Estimators for Hidden Markov Models and Stochastic Volatility Models

ABSTRACT.  This paper develops a new contrast process for parametric inference of general hidden Markov models, when the hidden chain has a non-compact state space. This contrast is based on the conditional likelihood approach, often used for ARCH-type models. We prove the strong consistency of the conditional likelihood estimators under appropriate conditions. The method is applied to the Kalman filter (for which this contrast and the exact likelihood lead to asymptotically equivalent estimators) and to the discretely observed stochastic volatility models.     

On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distribution

In this paper, we present a general formulation of an algorithm, the adaptive independent chain (AIC), that was introduced in a special context in Gåsemyr et al . [ Methodol. Comput. Appl. Probab. 3 (2001)]. The algorithm aims at producing samples from a specific target distribution Π, and is an adaptive, non-Markovian version of the Metropolis–Hastings independent chain. A certain parametric class of possible proposal distributions is fixed, and the parameters of the proposal distribution are updated periodically on the basis of the recent history of the chain, thereby obtaining proposals that get ever closer to Π. We show that under certain conditions, the algorithm produces an exact sample from Π in a finite number of iterations, and hence that it converges to Π. We also present another adaptive algorithm, the componentwise adaptive independent chain (CAIC), which may be an alternative in particular in high dimensions. The CAIC may be regarded as an adaptive approximation to the Gibbs sampler updating parametric approximations to the conditionals of Π.     

A Non-parametric Frailty Model for Temporally Clustered Multivariate Failure Times

Abstract A model is introduced here for multivariate failure time data arising from heterogenous populations. In particular, we consider a situation in which the failure times of individual subjects are often temporally clustered, so that many failures occur during a relatively short age interval. The clustering is modelled by assuming that the subjects can be divided into ‘internally homogenous’ latent classes, each such class being then described by a time‐dependent frailty profile function. As an example, we reanalysed the dental caries data presented earlier in Härkänen et al. [Scand. J. Statist. 27 (2000) 577], as it turned out that our earlier model could not adequately describe the observed clustering.     

A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

Abstract.  A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs (CGs), the Lauritzen–Wermuth–Frydenberg (LWF) and the Andersson–Madigan– Perlman (AMP) Markov properties, which are different in general but coincide for the subclass of CGs with no flags . Markov equivalence induces a partition of the class of CGs into equivalence classes and every equivalence class contains a, possibly empty, subclass of CGs with no flags itself containing a, possibly empty, subclass of directed acyclic graphs (DAGs). LWF-Markov equivalence classes of CGs can be naturally characterized by means of the so-called largest CGs , whereas a graphical characterization of equivalence classes of DAGs is provided by the essential graphs . In this paper, we show the existence of largest CGs with no flags that provide a natural characterization of equivalence classes of CGs of this kind, with respect to both the LWF- and the AMP-Markov properties. We propose a procedure for the construction of the largest CGs, the largest CGs with no flags and the essential graphs, thereby providing a unified approach to the problem. As by-products we obtain a characterization of graphs that are largest CGs with no flags and an alternative characterization of graphs which are largest CGs. Furthermore, a known characterization of the essential graphs is shown to be a special case of our more general framework. The three graphical characterizations have a common structure: they use two versions of a locally verifiable graphical rule. Moreover, in case of DAGs, an immediate comparison of three characterizing graphs is possible.     

Sample selection in radiocarbon dating

Archaeologists working on the island of O'ahu, Hawai'i, use radiocarbon dating of samples of organic matter found trapped in fish-pond sediments to help them to learn about the chronology of the construction and use of the aquicultural systems created by the Polynesians. At one particular site, Loko Kuwili, 25 organic samples were obtained and funds were available to date an initial nine. However, on calibration to the calendar scale, the radiocarbon determinations provided date estimates that had very large variances. As a result, major issues of chronology remained unresolved and the archaeologists were faced with the prospect of another expensive programme of radiocarbon dating. This paper presents results of research that tackles the problems associated with selecting samples from those which are still available. Building on considerable recent research that utilizes Markov chain Monte Carlo methods to aid archaeologists in their radiocarbon calibration and interpretation, we adopt the standard Bayesian framework of risk functions, which allows us to assess the optimal samples to be sent for dating. Although rather computer intensive, our algorithms are simple to implement within the Bayesian radiocarbon framework that is already in place and produce results that are capable of direct interpretation by the archaeologists. By dating just three more samples from Loko Kuwili the expected variance on the date of greatest interest could be substantially reduced.     

Application of Markov chain Monte Carlo methods to modelling birth prevalence of Down syndrome

Data collected before the routine application of prenatal screening are of unique value in estimating the natural live-birth prevalence of Down syndrome. However, much of these data are from births from over 20 years ago and they are of uncertain quality. In particular, they are subject to varying degrees of underascertainment. Published approaches have used ad hoc corrections to deal with this problem or have been restricted to data sets in which ascertainment is assumed to be complete. In this paper we adopt a Bayesian approach to modelling ascertainment and live-birth prevalence. We consider three prior specifications concerning ascertainment and compare predicted maternal-age-specific prevalence under these three different prior specifications. The computations are carried out by using Markov chain Monte Carlo methods in which model parameters and missing data are sampled.     

基于MCMC稳态模拟的贝叶斯经验费率厘定信用模型

B黨lmann-Straub model is one of the most famous applications of the Bayesian method for the experience rate making.However,by the traditional B黨lmann-Straub model one cannot get the unbiased posterior estimation of the parameters when there is not sufficient prior information for the structural parameters;What's more,the difficult of computing high dimension numeration limits the application of Bayesian method.This paper introduces the Markov chain Monte Carlo simulaton method based on the Gibbs sampling after analyzing the structure of the B黨lmann-Straub model and sets up the Bayesian credibility model for estimating the predictive risk premium.Also by using the results of the numeration analysis,this paper proves that from this model one can get the posterior distributions of the parameters dynamically and the posterior estimation of the censoring parameters in the situation that exists unknown parameters,as well as improve the precision of the numeration,which can be helpful to find the heterogeneity of the premium.     

基于课程链的新工科单片机课程改革研究

新工科提出的主要原因是我国传统工程教育培养出的工程人才与当前社会经济发展新需求不相适应,迫切需要通过工程教育转型升级来培养新型工程人才,为我国从工程教育大国向工程教育强国转变提供支撑。为此,该文提出基于课程链的新工科单片机原理及应用课程改革。通过统筹课程链前端和后端的课程体系,设计出更符合社会企业要求的培养方案。研究结果表明,明确创新课程教学内容与教学手段,增加多维度的实践训练;加强校企合作,促进创新协同培养模式的形成,推动课程教学的创新改革与发展,以适应新工科教育的发展思路与总体目标。     

Markov (Set) chains application to predict mortality rates using extended Milevsky–Promislov generalized mortality models

The mortality rates ( μx,t) measure the frequency of deaths in a fixed: population and time interval. The ability to model and forecast μx,t allows determining, among others, fundamental characteristics of life expectancy tables, e.g. used to determine the amount of premium in life insurance, adequate to the risk of death. The article proposes a new method of modelling and forecasting μx,t, using the class of stochastic Milevsky–Promislov switch models with excitations. The excitations are modelled by second, fourth and sixth order polynomials of outputs from the non-Gaussian Linear Scalar Filter (nGLSF) model and taking into account the Markov (Set) chain. The Markov (Set) chain state space is defined based on even orders of the nGLSF polynomial. The model order determines the theoretical values of the death rates. The obtained results usually provide a more precise forecast of the mortality rates than the commonly used Lee–Carter model.