YoVDO

Linear Stochastic Graphon Systems with Q-Noise

Offered By: GERAD Research Center via YouTube

Tags

Linear Systems Courses Dynamical Systems Courses Nash Equilibrium Courses Mean-Field Games Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the cutting-edge research on modeling dynamical systems on large, dense networks using graphon limits in this 53-minute seminar presented by Alex Dunyak from McGill University. Delve into the extension of classical stochastic linear systems theory to systems on very large graphs, utilizing approximating graphons and Q-noise. Discover how this approach results in a stochastic differential equation in the space of square-integrable functions defined over the entire network. Learn about the convergence of linear quadratic Gaussian (LQG) optimal control problems on large networks to Q-noise LQG on graphons. Examine the explicit calculation of system states when graphon limits correspond to finite rank linear operators. Explore the approximation of Nash Equilibrium for linear stochastic mean-field tracking games on large graphs using optimal control problems on graphons, and understand how to derive closed-form solutions for optimal inputs for each agent in the graphon.

Syllabus

Linear Stochastic Graphon Systems with Q-Noise, Alex Dunyak


Taught by

GERAD Research Center

Related Courses

Control of Mobile Robots
Georgia Institute of Technology via Coursera
Analyse numérique pour ingénieurs
École Polytechnique Fédérale de Lausanne via Coursera
Bases Matemáticas: Álgebra
Universitat Politècnica de València via edX
Algèbre Linéaire (Partie 3)
École Polytechnique Fédérale de Lausanne via edX
Differential Equations: 2x2 Systems
Massachusetts Institute of Technology via edX