Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Markov Chains: Hitting Probabilities

In course

FIN-415: Probability and stochastic calculus

This course gives an introduction to probability theory and stochastic calculus in discrete and continuous time. The fundamental notions and techniques introduced in this course have many applications in finance, for example for option pricing, risk mana ...

Description

This lecture covers the concept of hitting probabilities in Markov chains, including the minimal non-negative solution of the system, the proof of hitting probabilities, and the recursive relationships. It also delves into the calculation of hitting times and the properties of the hitting probabilities.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Semyon Malamud

Damir Filipovic

Damir Filipovic holds the Swissquote Chair in Quantitative Finance and is Swiss Finance Institute Professor at the Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland. Prior to this, he was head of the Vienna Institute of Finance and professor at the University of Vienna. He previously held the chair of financial and insurance mathematics at the University of Munich, and he was on the faculty of Princeton University. He received his Ph.D. in mathematics from ETH Zurich in 2000. Damir Filipovic worked as a scientific consultant for the Swiss Federal Office of Private Insurance from 2003 to 2004. There he co-developed the Swiss Solvency Test, which defines the regulatory capital requirement for all Swiss based insurance companies and groups. He is on the editorial board of several academic journals. His research interests include the term structure of interest rates, credit and volatility risk, quantitative methods in risk management, and stochastic processes. His papers have been published in a variety of academic journals including the Journal of Financial Economics, Mathematical Finance, Finance and Stochastics, and the Annals of Applied Probability. He is the author of a textbook titled Term-Structure Models.

Official source

Related concepts (32)

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).

Markov model

In probability theory, a Markov model is a stochastic model used to model pseudo-randomly changing systems. It is assumed that future states depend only on the current state, not on the events that occurred before it (that is, it assumes the Markov property). Generally, this assumption enables reasoning and computation with the model that would otherwise be intractable. For this reason, in the fields of predictive modelling and probabilistic forecasting, it is desirable for a given model to exhibit the Markov property.

Markov property

In probability theory and statistics, the term Markov property refers to the memoryless property of a stochastic process, which means that its future evolution is independent of its history. It is named after the Russian mathematician Andrey Markov. The term strong Markov property is similar to the Markov property, except that the meaning of "present" is defined in terms of a random variable known as a stopping time. The term Markov assumption is used to describe a model where the Markov property is assumed to hold, such as a hidden Markov model.

Hidden Markov model

A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process — call it — with unobservable ("hidden") states. As part of the definition, HMM requires that there be an observable process whose outcomes are "influenced" by the outcomes of in a known way.

Socialist calculation debate

The socialist calculation debate, sometimes known as the economic calculation debate, was a discourse on the subject of how a socialist economy would perform economic calculation given the absence of the law of value, money, financial prices for capital goods and private ownership of the means of production. More specifically, the debate was centered on the application of economic planning for the allocation of the means of production as a substitute for capital markets and whether or not such an arrangement would be superior to capitalism in terms of efficiency and productivity.

Related lectures (40)

Hidden Markov Models: Primer

Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.

Hitting Probabilities: Markov Chains

Covers hitting probabilities in Markov chains with disjoint subsets, the function h(i), theorems, proofs, and expected time to hit calculations.

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: Introduction and Properties

Covers the introduction and properties of Markov chains, including transition matrices and stochastic processes.

Lindblad equation