Lecture

Markov Chains: Absorbing Classes

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers Markov chains with absorbing classes, focusing on exercises related to applied probability and stochastic processes. The slides present exercises on finding open and closed classes in a transition probability matrix, calculating expected values, and analyzing the behavior of a frog hopping on lily pads. The instructor discusses the graphical representation of Markov chains, cubing transition matrices, and solving the gambler's ruin problem. Through practical examples, students learn to determine probabilities of staying in a state, reaching a specific state, and the average time to reach a destination.

Official source

Related concepts (32)

Probability

Probability is the branch of mathematics concerning numerical descriptions of how likely an event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speaking, 0 indicates impossibility of the event and 1 indicates certainty. The higher the probability of an event, the more likely it is that the event will occur. A simple example is the tossing of a fair (unbiased) coin.

Bayesian probability

Bayesian probability (ˈbeɪziən or ˈbeɪʒən ) is an interpretation of the concept of probability, in which, instead of frequency or propensity of some phenomenon, probability is interpreted as reasonable expectation representing a state of knowledge or as quantification of a personal belief. The Bayesian interpretation of probability can be seen as an extension of propositional logic that enables reasoning with hypotheses; that is, with propositions whose truth or falsity is unknown.

Probability theory

Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expressing it through a set of axioms. Typically these axioms formalise probability in terms of a probability space, which assigns a measure taking values between 0 and 1, termed the probability measure, to a set of outcomes called the sample space.

Probability space

In probability theory, a probability space or a probability triple is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models the throwing of a die. A probability space consists of three elements: A sample space, , which is the set of all possible outcomes. An event space, which is a set of events, , an event being a set of outcomes in the sample space. A probability function, , which assigns each event in the event space a probability, which is a number between 0 and 1.

Markov chain

A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC).

Related lectures (64)

Probability & Stochastic Processes

Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.

The Marriage Problem

Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.

Expected Number of Visits in State

Covers the criterion for recurrence in infinite chains based on the expected number of visits in a state.

Markov Chains: Ergodicity and Stationary Distribution

Explores ergodicity and stationary distribution in Markov chains, emphasizing convergence properties and unique distributions.

Elements of Statistics: Probability and Random Variables