Cadenes de Markov a temps discret i la seva simulació

Abstract

[en] Markov chains are stochastic processes characterized by the fact that the outcome in a given state depends only on the previous state. In this work we will study this notion assuming time is discrete, as well as the properties that derive from it and how they can be classified in an environment where time does not intervene in its evolution. Finally, we will analyze a specific case, along with simulations on R and C.