Threshold Functions for Markov Chains: a Graph Theoretic Approach
From MaRDI portal
Publication:4289299
Recommendations
- Graphes et algorithme de calcul de probabilités stationnaires d'un processus markovien discret. (Graphs and algorithm for the computation of stationary probabilities of a discrete Markov process)
- scientific article; zbMATH DE number 1047756
- scientific article; zbMATH DE number 482624
- Transient phenomena for Markov chains and applications
Cites work
- scientific article; zbMATH DE number 3514781 (Why is no real title available?)
- scientific article; zbMATH DE number 3239038 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- Aggregation of Variables in Dynamic Systems
- Almost sure theories
- Mean Passage Times and Nearly Uncoupled Markov Chains
- The reduction of perturbed Markov generators
Cited in
(7)- From diffusions on graphs to Markov chains via asymptotic state lumping
- Markov chains in a Dirichlet environment and hypergeometric integrals
- A graph-algorithmic approach for the study of metastability in Markov chains
- Random Walks, Directed Cycles, and Markov Chains
- Transient phenomena for Markov chains and applications
- Optimal Ventcel graphs, minimal cost spanning trees and asymptotic probabilities
- A characterization of Markov chains on infinite graphs by limiting distributions
This page was built for publication: Threshold Functions for Markov Chains: a Graph Theoretic Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289299)
