A linear-time algorithm for classifying the states of a finite Markov chain

DOI10.1016/0167-6377(84)90082-8zbMath0529.60072OpenAlexW1991685644MaRDI QIDQ787588

Donald K. Friesen, Bryan L. Deuermeyer

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90082-8

zbMATH Keywords

graph theorytransition graphtree algorithms

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (2)

A non-recursive algorithm for classifying the states of a finite Markov chain ⋮ Opinion Manipulation in Social Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of discrete Markov systems by means of stochastic graphs
• Two Problems in Markov Chains: A Topological Approach
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A linear-time algorithm for classifying the states of a finite Markov chain