Markow 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 Markow Chain Markow 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=R⁺), auto-normal dynamics (E = R), auto-Poissonian dynamics (E = 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.     

Improved approaches to interval estimation of effective doses for a logistic dose-response curve

Asymptotic confidence (delta) intervals and intervals based upon the use of Fieller's theorem are alternative methods for constructing intervals for the <$>\gamma<$>% effective doses (ED<$>_\gamma<$>). Sitter and Wu (1993) provided a comparison of the two approaches for the ED<$>_{50}<$>, for the case in which a logistic dose response curve is assumed. They showed that the Fieller intervals are generally superior. In this paper, we introduce two new families of intervals, both of which include the delta and Fieller intervals as special cases. In addition we consider interval estimation of the ED<$>_{90}<$> as well as the ED<$>_{50}<$>. We provide a comparison of the various methods for the problem of constructing a confidence interval for the ED<$>_\gamma<$>.     

Formulating robust regression estimation as an optimum allocation problem

The Mallows-type estimator, one of the most reasonable bounded influence estimators, often downweights leverage points regardless of the magnitude of the corresponding residual, and this could imply a loss of efficiency. In this article, we consider whether the efficiency of this bounded influence estimator could be improved by regarding both the robust x -distance and the residual size. We develop a new robust procedure based on the ideas of the Mallows-type estimator and the general robust recipe, where data been cleaned by pulling outliers towards their fitted values. Our basic idea is to formulate the robust estimation as an allocation problem, where the objective function is a Huber-type "loss" function, but the pulling resource is restricted. Using a mathematical programming technique, the pulling resource is optimally allocated to influential points <$>({x}_i, y_i)<$> with respect to residual size and given weights, <$>w({x}_i)<$>. Three previously published approaches are compared to our proposal via simulated experiments. In the case of contaminated data by regression outliers and "good" leverage points, the proposed robust estimator is a reasonable bounded influence estimator concerning both efficiency and norm of bias. In addition, the proposed approach offers the potential to establish constraints for the regression parameters and also may potentially provide insight regarding outlier detection.     

Profust reliability of linear and circular type F and G systems having two failure criteria under Markov dependency

In this study, the profust reliabilities of (n, f, k): F(G) and < n, f, k > : F(G) systems for Markov dependent components are investigated. Having two failure criteria are the common features of these four systems. The usage of both fuzzy approach and two failure criteria in the same system provides us more realistic approach to evaluate the reliability of more complex systems. The component configurations are examined for both linear and circular sequences and the working principle of systems are studied for both F and G systems. Under all these assumptions, the profust reliabilities of (n, f, k): F(G) and < n, f, k > : F(G) systems are obtained using the distribution of run statistics. Also a new membership function different from the linear membership function which is generally used in the literature is proposed. Some numerical results which allow the comparison of the systems from various perspectives and various figures for both linear and circular type systems are presented. Some special cases (between Markov – iid assumption, conventional – profust reliability) are also considered.     

Limit distributions of unbiased estimators in natural exponential families

We obtain the possible limit distributions of unbiased estimators of functions of the parameter of a natural exponential family. The limit distribution depends on <$>j<$>, the order of the first non-zero derivative at the true (but usually unknown) value of the parameter. We show that if <$>j \geq 2<$> then the umvu and the maximum likelihood estimators are not asymptotically equivalent.     

A note on finite-sample efficiencies of estimators for the minimum volume ellipsoid

Among the most well known estimators of multivariate location and scatter is the Minimum Volume Ellipsoid (MVE). Many algorithms have been proposed to compute it. Most of these attempt merely to approximate as close as possible the exact MVE, but some of them led to the definition of new estimators which maintain the properties of robustness and affine equivariance that make the MVE so attractive. Rousseeuw and van Zomeren (1990) used the <$>(p+1)<$>- subset estimator which was modified by Croux and Haesbroeck (1997) to give rise to the averaged <$>(p+1)<$>- subset estimator . This note shows by means of simulations that the averaged <$>(p+1)<$>-subset estimator outperforms the exact estimator as far as finite-sample efficiency is concerned. We also present a new robust estimator for the MVE, closely related to the averaged <$>(p+1)<$>-subset estimator, but yielding a natural ranking of the data.     

On the Markov property of order statistics

The order statistics from a sample of size n≥3 from a discrete distribution form a Markov chain if and only if the parent distribution is supported by one or two points. More generally, a necessary and sufficient condition for the order statistics to form a Markov chain for (n≥3) is that there does not exist any atom x₀ of the parent distribution F satisfying F(x₀-)>0 and F(x₀)<1. To derive this result a formula for the joint distribution of order statistics is proved, which is of an interest on its own. Many exponential characterizations implicitly assume the Markov property. The corresponding putative geometric characterizations cannot then be reasonably expected to obtain. Some illustrative geometric characterizations are discussed.     

Granger-causality in Markov switching models

In this paper, we propose a new approach for characterizing and testing Granger-causality, which is well equipped to handle models where the change in regime evolves according to multiple Markov chains. Differently from the existing literature, we propose a method for analysing causal links that specifically takes into account Markov chains. Tests for independence are also provided. We illustrate the methodology with an empirical application, and in particular, we investigate the causality and interdependence between financial and economic cycles in USA using the bivariate Markov switching model proposed by Hamilton and Lin [13 J.D. Hamilton and J. Lin, Stock market volatility and business cycle, J. Appl. Econ. 11(5) (1996), pp. 573–593. doi: 10.1002/(SICI)1099-1255(199609)11:5<573::AID-JAE413>3.0.CO;2-T[Crossref], [Web of Science ®] , [Google Scholar]]. We find that financial variables are useful in forecasting the aggregate economic activity, and vice versa.     

Markov Systems in a General State Space

In this article, we introduce and study Markov systems on general spaces (MSGS) as a first step of an entire theory on the subject. Also, all the concepts and basic results needed for this scope are given and analyzed. This could be thought of as an extension of the theory of a non homogeneous Markov system (NHMS) and that of a non homogeneous semi-Markov system on countable spaces, which has realized an interesting growth in the last thirty years. In addition, we study the asymptotic behaviour or ergodicity of Markov systems on general state spaces. The problem of asymptotic behaviour of Markov chains has been central for finite or countable spaces since the foundation of the subject. It has also been basic in the theory of NHMS and NHSMS. Two basic theorems are provided in answering the important problem of the asymptotic distribution of the population of the memberships of a Markov system that lives in the general space (X, ?(X)). Finally, we study the total variability from the invariant measure of the Markov system given that there exists an asymptotic behaviour. We prove a theorem which states that the total variation is finite. This problem is known also as the coupling problem.     

A distance-based diagnostic for trans-dimensional Markov chains

Over the last decade the use of trans-dimensional sampling algorithms has become endemic in the statistical literature. In spite of their application however, there are few reliable methods to assess whether the underlying Markov chains have reached their stationary distribution. In this article we present a distance-based method for the comparison of trans-dimensional Markov chain sample output for a broad class of models. This diagnostic will simultaneously assess deviations between and within chains. Illustration of the analysis of Markov chain sample-paths is presented in simulated examples and in two common modelling situations: a finite mixture analysis and a change-point problem.     

A continuous-time Markov model for estimating readmission risk for hospital inpatients

Research concerning hospital readmissions has mostly focused on statistical and machine learning models that attempt to predict this unfortunate outcome for individual patients. These models are useful in certain settings, but their performance in many cases is insufficient for implementation in practice, and the dynamics of how readmission risk changes over time is often ignored. Our objective is to develop a model for aggregated readmission risk over time – using a continuous-time Markov chain – beginning at the point of discharge. We derive point and interval estimators for readmission risk, and find the asymptotic distributions for these probabilities. Finally, we validate our derived estimators using simulation, and apply our methods to estimate readmission risk over time using discharge and readmission data for surgical patients.     

Testing for two states in a hidden Markov model

The authors consider hidden Markov models (HMMs) whose latent process has m ≥ 2 states and whose state‐dependent distributions arise from a general one‐parameter family. They propose a test of the hypothesis m = 2. Their procedure is an extension to HMMs of the modified likelihood ratio statistic proposed by Chen, Chen & Kalbfleisch (2004) for testing two states in a finite mixture. The authors determine the asymptotic distribution of their test under the hypothesis m = 2 and investigate its finite‐sample properties in a simulation study. Their test is based on inference for the marginal mixture distribution of the HMM. In order to illustrate the additional difficulties due to the dependence structure of the HMM, they show how to test general regular hypotheses on the marginal mixture of HMMs via a quasi‐modified likelihood ratio. They also discuss two applications.     

Piecewise deterministic Markov processes applied to fatigue crack growth modelling

In this paper, we use a particular piecewise deterministic Markov process (PDMP) to model the evolution of a degradation mechanism that may arise in various structural components, namely, the fatigue crack growth. We first derive some probability results on the stochastic dynamics with the help of Markov renewal theory: a closed-form solution for the transition function of the PDMP is given. Then, we investigate some methods to estimate the parameters of the dynamical system, involving Bogolyubov's averaging principle and maximum likelihood estimation for the infinitesimal generator of the underlying jump Markov process. Numerical applications on a real crack data set 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.     

Characterization of discrete scale invariant Markov sequences

ABSTRACT

Some special sampling of discrete scale invariant (DSI) processes are presented to provide a multi-dimensional self-similar process in correspondence. By imposing Markov property we show that the covariance functions of such Markov DSI sequences are characterized by variance, and covariance of adjacent samples in the first scale interval. We also provide a theoretical method for estimating spectral density matrix of corresponding multi-dimensional self-similar Markov process. Some examples such as simple Brownian motion (sBm) with drift and scale invariant autoregressive model are presented and these properties are investigated. We present two new method to estimate Hurst parameter of DSI processes and apply them to some sBm and also to the SP500 indices for some period which has DSI property. We compare our estimates with the maximum-likelihood and rescaled range (R/S) method which are applied to the corresponding multi-dimensional self-similar processes.     

Long-Range Dependence of Markov Renewal Processes

This paper examines long‐range dependence (LRD) and asymptotic properties of Markov renewal processes generalizing results of Daley for renewal processes. The Hurst index and discrepancy function, which is the difference between the expected number of arrivals in (0, t] given a point at 0 and the number of arrivals in (0, t] in the time stationary version, are examined in terms of the moment index. The moment index is the supremum of the set of r > 0 such that the rth moment of the first return time to a state is finite, employing the solidarity results of Sgibnev. The results are derived for irreducible, regular Markov renewal processes on countable state spaces. The paper also derives conditions to determine the moment index of the first return times in terms of the Markov renewal kernel distribution functions of the process.     

Alternative Markov Properties for Chain Graphs

Graphical Markov models use graphs to represent possible dependences among statistical variables. Lauritzen, Wermuth, and Frydenberg (LWF) introduced a Markov property for chain graphs (CG): graphs that can be used to represent both structural and associative dependences simultaneously and that include both undirected graphs (UG) and acyclic directed graphs (ADG) as special cases. Here an alternative Markov property (AMP) for CGs is introduced and shown to be the Markov property satisfied by a block-recursive linear system with multivariate normal errors. This model can be decomposed into a collection of conditional normal models, each of which combines the features of multivariate linear regression models and covariance selection models, facilitating the estimation of its parameters. In the general case, necessary and sufficient conditions are given for the equivalence of the LWF and AMP Markov properties of a CG, for the AMP Markov equivalence of two CGs, for the AMP Markov equivalence of a CG to some ADG or decomposable UG, and for other equivalences. For CGs, in some ways the AMP property is a more direct extension of the ADG Markov property than is the LWF property.     

Transient analysis of a finite source discrete-time queueing system using homogeneous Markov system with state size capacities (HMS/c)

Abstract

In this article, a finite source discrete-time queueing system is modeled as a discrete-time homogeneous Markov system with finite state size capacities (HMS/c) and transition priorities. This Markov system is comprised of three states. The first state of the HMS/c corresponds to the source and the second one to the state with the servers. The second state has a finite capacity which corresponds to the number of servers. The members of the system which can not enter the second state, due to its finite capacity, enter the third state which represents the system's queue. In order to examine the variability of the state sizes recursive formulae for their factorial and mixed factorial moments are derived in matrix form. As a consequence the probability mass function of each state size can be evaluated. Also the expected time in queue is computed by means of the interval transition probabilities. The theoretical results are illustrated by a numerical example.