Lecture

Markov Chains: Hitting Probabilities

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.

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.

Instructors (2)

Semyon Malamud

Teaching & PhD PhD Students Johannes Schwab, Onur Demiray, Giuseppe Matera Past EPFL PhD Students Rémy Praz, Evgeny Petrov, Yuan Zhang, Julien Arsène Blatt, Erik Hapnes, Teng Andrea Xu, Boris Kuznetsov Courses Big Data and Machine Learning for Financial Economics FIN-622 This class is an introduction to Machine Learning and High Dimensional Statistics in Finance. We start with purely empirical approach, focusing first on high dimensional regressions then moving to kernel methods and deep l

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 (31)

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.

Calculation in kind

NOTOC Calculation in kind or calculation in-natura is a way of valuating resources and a system of accounting that uses disaggregated physical magnitudes as opposed to a common unit of calculation. As the basis for a socialist economy, it was proposed to replace money and financial calculation. In an in-kind economy products are produced for their use values (their utility) and accounted in physical terms. By contrast, in money-based economies, commodities are produced for their exchange value and accounted in monetary terms.

Related lectures (64)

Probability & Stochastic Processes

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

Markov Chains: Theory and Applications

Covers the theory and applications of Markov chains in modeling random phenomena and decision-making under uncertainty.

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.

Markov Chains: Introduction and Properties

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

Hitting Probabilities: Markov Chains