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

Lecture

Invariant Measures: Properties and Applications

Description

This lecture introduces the concept of invariant measures in the context of Markov chains, focusing on their properties and applications. The instructor explains how invariant measures differ from invariant distributions and discusses their significance in continuous-time processes. The lecture covers the existence and uniqueness of invariant measures, along with their role in analyzing irreducible recurrent Markov chains. Key topics include the proof of existence, temporal shifts, and the ergodic theorem.

Instructor

Thomas Mountford

D'origine britannique, né en 1961. Il a reçu la bourse présidentielle des jeunes investisseurs (Presidential Young Investigator Grant) en 1990 et le prix de la Fraternité Sloan (Sloan Fellowship) en 1991. Son travail montre que les valeurs critiques d'une classe large de de systèmes de particules proches sont égales à 1, et que, suite à plusieurs travaux sur la trajectoire du mouvement brownien, incluant une simulation numérique, le nombre d'îlots browniens en 2 dimensions tend vers l'infini quand leurs tailles tendent vers 0. Il reçoit le prix Rosenbaum en 1993 lui ouvrant ainsi les portes du Isaac Newton Institute à Cambridge. Il est également décoré par le prix Rollo Davidson en 1995 et nommé membre honoraire de l'Institute of Mathematical Statistics en 2001. Assistant Profeseur de Mathematique a UCLA 1987- 1991 Associate Professeur de Mathematique a UCLA 1991-1993 Professeur de Mathematique a UCLA 1993-2001 Professeur Departement de mathématiques, EPFL dès 2001

Official source

Related concepts (19)

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

Ergodic theory

Ergodic theory is a branch of mathematics that studies statistical properties of deterministic dynamical systems; it is the study of ergodicity. In this context, "statistical properties" refers to properties which are expressed through the behavior of time averages of various functions along trajectories of dynamical systems. The notion of deterministic dynamical systems assumes that the equations determining the dynamics do not contain any random perturbations, noise, etc.

Ergodicity

In mathematics, ergodicity expresses the idea that a point of a moving system, either a dynamical system or a stochastic process, will eventually visit all parts of the space that the system moves in, in a uniform and random sense. This implies that the average behavior of the system can be deduced from the trajectory of a "typical" point. Equivalently, a sufficiently large collection of random samples from a process can represent the average statistical properties of the entire process.

Ergodic hypothesis

In physics and thermodynamics, the ergodic hypothesis says that, over long periods of time, the time spent by a system in some region of the phase space of microstates with the same energy is proportional to the volume of this region, i.e., that all accessible microstates are equiprobable over a long period of time. Liouville's theorem states that, for a Hamiltonian system, the local density of microstates following a particle path through phase space is constant as viewed by an observer moving with the ensemble (i.

Probability distribution

In probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of different possible outcomes for an experiment. It is a mathematical description of a random phenomenon in terms of its sample space and the probabilities of events (subsets of the sample space). For instance, if X is used to denote the outcome of a coin toss ("the experiment"), then the probability distribution of X would take the value 0.5 (1 in 2 or 1/2) for X = heads, and 0.

Related lectures (31)

Markov Chains: Ergodicity and Stationary Distribution

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

Coupling of Markov Chains: Ergodic Theorem

Explores the coupling of Markov chains and the proof of the ergodic theorem, emphasizing distribution convergence and chain properties.

Limiting Distribution and Ergodic Theorem

Explores limiting distribution in Markov chains and the implications of ergodicity and aperiodicity on stationary distributions.

Theory of MCMC

Covers the theory of Markov Chain Monte Carlo (MCMC) sampling and discusses convergence conditions, transition matrix choice, and target distribution evolution.

Markov Chains: Stationary Distributions