http://popups.lib.uliege.be/1373-5411/index.php?id=3192 A characterization of a simple Markov process based on a random graph theoretic structure is introduced. We propose a polynomial time algorithm for the calculation of a limit state matrix. The algorithm is based on two procedures which will be derived in this contribution. They exploit a distinguished decomposition principle of the underlying graph theoretic structure and the special property of an acyclic directed graph. Full text issues Volume 25 Risk Management, Optimization, and Control fr Wed, 11 Sep 2024 17:01:24 +0200 Wed, 11 Sep 2024 17:01:55 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=3192 0