We study ergodicity for upper transition operators: bounded, sub-additive and non-negatively homogeneous transformations of finite-dimensional linear spaces. Ergodicity provides a necessary and sufficient condition for Perron-Frobenius-like convergence behaviour for upper transition operators. It can also be characterised alternatively using accessibility relations: ergodicity is equivalent with there being a single maximal communication (or top) class that is moreover regular and absorbing. We present efficient algorithms for checking these conditions. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Hermans, F., & de Cooman, G. (2010). Ergodicity conditions for upper transition operators. In Communications in Computer and Information Science (Vol. 80 PART 1, pp. 70–79). https://doi.org/10.1007/978-3-642-14055-6_8
Mendeley helps you to discover research relevant for your work.