Displaying similar documents to “A graph method for Markov models solving”

Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs

Johannes Fehrenbach, Ludger Rüschendorf (2005)

Applicationes Mathematicae

Similarity:

We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also...

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.

Stopping Markov processes and first path on graphs

Giacomo Aletti, Ely Merzbach (2006)

Journal of the European Mathematical Society

Similarity:

Given a strongly stationary Markov chain (discrete or continuous) and a finite set of stopping rules, we show a noncombinatorial method to compute the law of stopping. Several examples are presented. The problem of embedding a graph into a larger but minimal graph under some constraints is studied. Given a connected graph, we show a noncombinatorial manner to compute the law of a first given path among a set of stopping paths.We prove the existence of a minimal Markov chain without oversized...