Upper and lower bounds for stochastic marked graphs
A form of recurrence relations is used to derive efficiently computable bounds on the rate of strongly connected SMGS (stochastic marked graphs).
scientific article; zbMATH DE number 561599
scientific article