Lecture

Markov Chains: Basics and Applications

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

MATH-414: Stochastic simulation

The student who follows this course will get acquainted with computational tools used to analyze systems with uncertainty arising in engineering, physics, chemistry, and economics. Focus will be on sampling methods as Monte Carlo, quasi Monte Carlo, Mark ...

Description

This lecture covers the fundamentals of Markov chains, focusing on discrete time and discrete space Markov chains. It explains the Markov property, transition matrices, generation algorithms, and examples like random walks. It also delves into continuous space Markov chains, transition kernels, and Poisson processes. The lecture concludes with discussions on non-homogeneous Poisson processes and general continuous time Markov chains.

Instructor

Fabio Nobile

Teaching & PhD PhD Students Veronica Montanaro, Matteo Raviola, Francesca Bettinelli, Eliott Van Dieren, Riccardo Saporiti, Giacomo Mossinelli, Noé Stauffer, Fabio Zoccolan Past EPFL PhD Students Diane Sylvie Guignard, Francesco Tesei, Eleonora Musharbash, Matthieu Claude Martin, Davide Pradovera, Sundar Subramaniam Ganesh, Eva Vidlicková, Juan Pablo Madrigal Cianci, Andrea Zanoni, Thomas Simon Spencer Trigo Trindade Past EPFL PhD Students as codirector Michele Pisaroni Courses Advanced analysis II - ve

Official source

Related concepts (29)

Homogeneous space

In mathematics, a homogeneous space is, very informally, a space that looks the same everywhere, as you move through it, with movement given by the action of a group. Homogeneous spaces occur in the theories of Lie groups, algebraic groups and topological groups. More precisely, a homogeneous space for a group G is a non-empty manifold or topological space X on which G acts transitively. The elements of G are called the symmetries of X.

Homogeneous function

In mathematics, a homogeneous function is a function of several variables such that, if all its arguments are multiplied by a scalar, then its value is multiplied by some power of this scalar, called the degree of homogeneity, or simply the degree; that is, if k is an integer, a function f of n variables is homogeneous of degree k if for every and For example, a homogeneous polynomial of degree k defines a homogeneous function of degree k.

Continuous function

In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in value, known as discontinuities. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is .

Continuous linear operator

In functional analysis and related areas of mathematics, a continuous linear operator or continuous linear mapping is a continuous linear transformation between topological vector spaces. An operator between two normed spaces is a bounded linear operator if and only if it is a continuous linear operator. Continuous function (topology) and Discontinuous linear map Bounded operator Suppose that is a linear operator between two topological vector spaces (TVSs). The following are equivalent: is continuous.

Poisson point process

In probability, statistics and related fields, a Poisson point process is a type of random mathematical object that consists of points randomly located on a mathematical space with the essential feature that the points occur independently of one another. The Poisson point process is often called simply the Poisson process, but it is also called a Poisson random measure, Poisson random point field or Poisson point field.

Related lectures (36)

Continuous Time Markov Chains

Introduces continuous time Markov chains on a finite state space with exponential waiting times and jump probabilities.

Generation of Markov Processes

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

Stochastic Simulation: Markov Processes Generation

Covers the generation of Markov processes and Poisson processes in stochastic simulation.

Lindblad equation

Covers the derivation of the Lindblad equation and the evolution of quantum gases.

Markov Chains: Theory and Applications