Displaying similar documents to “The behavior of a Markov network with respect to an absorbing class: the target algorithm”

Directed forests with application to algorithms related to Markov chains

Piotr Pokarowski (1999)

Applicationes Mathematicae

Similarity:

This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.

Two algorithms based on Markov chains and their application to recognition of protein coding genes in prokaryotic genomes

Małgorzata Grabińska, Paweł Błażej, Paweł Mackiewicz (2013)

Applicationes Mathematicae

Similarity:

Methods based on the theory of Markov chains are most commonly used in the recognition of protein coding sequences. However, they require big learning sets to fill up all elements in transition probability matrices describing dependence between nucleotides in the analyzed sequences. Moreover, gene prediction is strongly influenced by the nucleotide bias measured by e.g. G+C content. In this paper we compare two methods: (i) the classical GeneMark algorithm, which uses a three-periodic...

Fast simulation for road traffic network

Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.

Technical comment. A problem on Markov chains

Franco Giannessi (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A problem (arisen from applications to networks) is posed about the principal minors of the matrix of transition probabilities of a Markov chain.

Reduction of absorbing Markov chain

Mariusz Górajski (2009)

Annales UMCS, Mathematica

Similarity:

In this paper we consider an absorbing Markov chain with finite number of states. We focus especially on random walk on transient states. We present a graph reduction method and prove its validity. Using this method we build algorithms which allow us to determine the distribution of time to absorption, in particular we compute its moments and the probability of absorption. The main idea used in the proofs consists in observing a nondecreasing sequence of stopping times. Random walk on...

(Homogeneous) markovian bridges

Vincent Vigon (2011)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

(Homogeneous) Markov bridges are (time homogeneous) Markov chains which begin at a given point and end at a given point. The price to pay for preserving the homogeneity is to work with processes with a random life-span. Bridges are studied both for themselves and for their use in describing the transformations of Markov chains: restriction on a random interval, time reversal, time change, various conditionings comprising the confinement in some part of the state space. These bridges...