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

Lecture

Discrete Dynamical Systems

In course

MATH-111(f): Linear Algebra

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications. ...

Description

This lecture covers the concept of discrete dynamical systems, focusing on eigenvalues, determinants, traces, and stochastic matrices. It explains the behavior of sequences, prey-predator systems, Markov chains, and long-term system analysis.

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

Instructor

Mikaël Cavallin

Official source

Related concepts (22)

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

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

Determinant

In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix A is denoted det(A), det A, or .

Eigenvalue algorithm

In numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Eigenvalues and eigenvectors and Generalized eigenvector Given an n × n square matrix A of real or complex numbers, an eigenvalue λ and its associated generalized eigenvector v are a pair obeying the relation where v is a nonzero n × 1 column vector, I is the n × n identity matrix, k is a positive integer, and both λ and v are allowed to be complex even when A is real.

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.

Related lectures (53)

Spectral Gap in Markov Chains

Explores the spectral gap in Markov chains and its impact on convergence speed.

Stationary Distribution in Markov Chains

Explores the concept of stationary distribution in Markov chains, discussing its properties and implications, as well as the conditions for positive-recurrence.

Eigenvalues and Eigenvectors of Markov Chains

Explores eigenvalues and eigenvectors of Markov chains, focusing on convergence rates and matrix properties.

Markov Chain Analysis

Delves into Markov chains by analyzing a scenario with two fleas moving in opposite directions, exploring transition matrices and probabilities over time.

Cut-off Phenomenon