Threshold Functions for Markov Chains: a Graph Theoretic Approach
From MaRDI portal
Publication:4289299
DOI10.1017/S0963548300000729zbMATH Open0797.60055MaRDI QIDQ4289299FDOQ4289299
Authors: James Lynch
Publication date: 28 April 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
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
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Cites Work
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)