two-state Markov chains
11 Conditional probability and Markov chains
... Interestingly, the probabilities determined in Example 13 are identical, to the accuracy to which they are expressed (4 decimal places). This seems to indicate that, in this example, after a while the values in the ...
30
On the Embedding Problem for Three-state Markov Chains
... discrete-time Markov chains and the existence of probability roots of transition matrices are investigated in [12], [9], [7] and ...for Markov chains with two states detailed insights ...
5
Quantitative contraction rates for Markov chains on general state spaces
... the Markov chain has a Ricci curvature lower bound c on the metric space (S, ρ) ...the Markov chain is mainly making “small” ...suggest two different ...
37
A new method for approximating vector autoregressive processes by finite state Markov chains
... the Markov chain con- structed by Rouwenhorst’s (1995) method is a binomial ...the Markov chain constructed by Rouwen- horst’s (1995) method converges asymptotically (as the number of states goes to ...
28
Convergence of alternating Markov chains
... have two Markov chains defined on the same state ...of two different updating schemes for MCMC estimation, when much faster convergence can be achieved by alternating both schemes than ...
6
Spectral Clustering for Graphs and Markov Chains
... of Markov random walks on a graph ...a Markov random walk on a graph can achieve the normalized cut on this ...a Markov chain provide a means of grouping the states of the ...steady state. We ...
141
Actuarial Modelling with Mixtures of Markov Chains
... of two joint-life models discussed in Chapter 4 provides a new approach to in- vestigate the dependence of joint ...of two four-state Markov chains captures the dependence that arises ...
114
Computation for Markov Chains
... a Markov chain is a (row) stochastic matrix, ...these two books and from the lecture notes in Theory of Matrices and Applications by Meyer at North Carolina State University ...
145
The strong deviation theorem for discrete time and continuous state nonhomogeneous Markov chains
... There have been some works on deviation theorem, a kind of strong limit theorem rep- resented by inequalities. Liu and Yang [] have studied the limit properties of a class of averages of functions of two ...
8
Equivalence and Minimization for Model Checking Labeled Markov Chains
... the two initial vectors of the hyperexponential ...the state and model checking of the isolated states does not answer the question whether the formula holds for the system or does not ...
8
Limit Theorems on Fuzzy Markov Chains
... of Markov systems provide an effective and powerful tool for describing State of the ...the Markov property requires that knowledge of the current state of the system provides all the ...
7
Topics in the theory and applications of Markov chains
... and Two of this thesis depend heavily on certain results of Vere-Jones (1962)(1967), Pruitt (196U), Kendall (1966a) and Moy (1967), which extend the Perron-Frobenius theory of finite non-negative matrices (see ...
145
Markov Chains for Robust Graph Based Commonsense Information Extraction
... The Markov chain consists of states for every node and a transition matrix ...The state transition probabilities in Q are fixed by taking the edge weights and 1) incorporating random transitions to the ...
8
Perfect sampling for nonhomogeneous Markov chains and hidden Markov models
... nonhomogeneous chains which we know of are Glynn and Thorisson (2001) and Stenflo (2008), which respectively provide perfect sampling methods for Markov chains condi- tioned to avoid certain states, ...
35
Non reversible Metropolis Hastings
... Here h is a suitable stepsize. This discretization is approx- imately correct if h is chosen to be sufficiently small. However, such a choice of h results in slow convergence to equilibrium of the Markov chain. ...
17
Accelerating Markov chain Monte Carlo via parallel predictive prefetching
... The second class of parallel MCMC algorithms uses parallelism through speculative execu- tion to accelerate individual chains. This idea is called prefetching in some of the literature and appears to have received ...
128
Attribution of Customers’ Actions Based on Machine Learning Approach
... Boosting over decision trees is considered one of the most efficient machine learn- ing algorithms. The idea of boosting approach is as follows: it iteratively trains new basic classifiers that improve the composition of ...
13
On Limiting Distributions of Quantum Markov Chains
... of Markov chains, when appropriately generalized, provides a potent paradigm for analyzing the stochastic evolution of quantum ...quantum Markov chains, especially in the guise of quantum ...
13
A Bayesian model for binary Markov chains
... dent Markov chains each with 21 observations; obviously, the chains may be of differing ...first state X 0 , in each chain, is equal to ...
9
Non homogeneous Markov chains with a finite state space and a Doeblin type theorem
... The second step is to consider restrictions of the sequence of blocks each block is a product of length da to an essential class with period da; these restrictions are allowable nonnegat[r] ...
6