Resumen de Stopping Markov processes and first path on graphs

Giacomo Aletti, Ely Merzbach

• Given a strongly stationary Markov chain (discrete or continuous) and a finite set of stopping rules, we show a non combinatorial method to compute the law of stopping. Several applied examples are presented. The problem of embedding a graph into a larger but minimal graph under some constraints is studied. Given a connected graph, we show a non combinatorial manner to compute the law of a first given path among a set of stopping paths. We prove the existence of a minimal Markov chain without oversized information.