Recurrence theorems for topological Markov chains

Recurrence theorems place conditions under which probabilistic systems, specifically Markov chains, are expected to visit certain states infinitely often. For example, a printer with its many moving parts and the random requests it receives, may be described as a probabilistic system, and recurrence of the "ready to print" state is desirable. Recurrence theorems in the case of finite Markov chains are widely known.

In this talk, we are interested in generalization to the infinitary setting. As it turns out, some care has to be put in the definition of infinite Markov chains. Rather than simply infinite, the introduct topological Markov chains, and show how standard constructions can be naturally extended to thisframework: path spaces, cylinder sets, as well as the semantic of LTL and PCTL. With all these tools in hand, we finally state our recurrence theorems.

This is work in progress in collaboration with Natsuki Urabe and Ichiro Hasuo.

This seminar is hold in a hybrid style. If you want attend the seminar onsite, please contact to Keita Mikami.