Scientific

Differential Equations and Algebraic Geometry - 5

Speaker: 
Andreas Malmendier
Date: 
Mon, Nov 15, 2021
Location: 
PIMS, University of Alberta
Zoom
Online
Conference: 
PIMS Network Courses
Differential Equations and Algebraic Geometry
Abstract: 

This is a guest lecture in the PIMS Network Wide Graduate Course in Differential Equations in Algebraic Geometry.

Class: 

Differential Equations and Algebraic Geometry - 4

Speaker: 
Matt Kerr
Date: 
Fri, Nov 5, 2021
Location: 
PIMS, University of Alberta
Zoom
Online
Conference: 
PIMS Network Courses
Differential Equations and Algebraic Geometry
Abstract: 

This is a guest lecture in the PIMS Network Wide Graduate Course in Differential Equations in Algebraic Geometry.

Class: 

Differential Equations and Algebraic Geometry - 3

Speaker: 
Adrian Clingher
Date: 
Wed, Nov 3, 2021
Location: 
PIMS, University of Alberta
Zoom
Online
Conference: 
PIMS Network Courses
Differential Equations and Algebraic Geometry
Abstract: 

This is a guest lecture in the PIMS Network Wide Graduate Course in Differential Equations in Algebraic Geometry.

Class: 

Z_2 harmonic spinors in gauge theory

Speaker: 
Rafe Mazzeo
Date: 
Thu, Nov 18, 2021
Location: 
Zoom
Online
Conference: 
PIMS Network Wide Colloquium
Abstract: 

Gauge-theoretic moduli spaces are often noncompact, and various techniques have been introduced to study their asymptotic features. Seminal work by Taubes shows that in many situations where the failure of compactness for sequences of solutions is due to the noncompactness of the gauge group, diverging sequences of solutions lead to what he called Z_2 harmonic spinors. These are multivalued solutions of a twisted Dirac equation which are branched along a codimension two subset. This leads to a number of new problems related to these Z_2 harmonic spinors as interesting geometric objects in their own right. I will survey this subject and talk about some recent work in progress with Haydys and Takahashi to compute the index of the associated deformation problem.

Speaker Biography

Rafe Mazzeo is an expert in PDEs and Microlocal analysis. He did his PhD at MIT, and was then appointed as Szegő Assistant Professor at Stanford University, where he is now Professor and Chair of the Department of Mathematics. He has served the mathematical community in many important ways, including as Director of the Park City Mathematics Institute.

Class: 

Graphon Mean Field Games and the GMFG Equations

Speaker: 
Peter Caines
Date: 
Thu, Oct 28, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

The existence of Nash equilibria in the Mean Field Game (MFG) theory of large non-cooperative populations of stochastic dynamical agents is established by passing to the infinite population limit. Individual agent feedback strategies are obtained via the MFG equations consisting of (i) a McKean-Vlasov-Hamilton-Jacobi-Bellman equation generating the Nash values and the best response control actions, and (ii) a McKean-Vlasov-Fokker-Planck-Kolmogorov equation for the probability distribution of the state of a generic agent in the population, otherwise known as the mean field. The applications of MFG theory now extend from economics and finance to epidemiology and physics.

In current work, MFG and MF Control theory is extended to Graphon Mean Field Game (GMFG) and Graphon Mean Field Control (GMFC) theory. Very large scale networks linking dynamical agents are now ubiquitous, with examples being given by electrical power grids, the internet, financial networks and epidemiological and social networks. In this setting, the emergence of the graphon theory of infinite networks has enabled the formulation of the GMFG equations for which we have established the existence and uniqueness of solutions. Applications of GMFG and GMFC theory to systems on particular networks of interest are being investigated and computational methods developed. As in the case of MFG theory, it is the simplicity of the infinite population GMFG and GMFC strategies which, in principle, permits their application to otherwise intractable problems involving large populations on complex networks. Work with Minyi Huang

Class: 
Subject: 

Differential Equations and Algebraic Geometry - 2

Speaker: 
Hossein Movasati
Date: 
Sat, Oct 30, 2021
Location: 
PIMS, University of Alberta
Zoom
Conference: 
PIMS Network Courses
Differential Equations and Algebraic Geometry
Abstract: 

This is a guest lecture in the PIMS Network Wide Graduate Course in Differential Equations in Algebraic Geometry.

Class: 

Mitigating Epidemics: Perspectives from Stackelberg Mean Field Games and Graphon Games

Speaker: 
Mathieu Lauriere
Date: 
Fri, Oct 29, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

In this talk, we consider epidemic models with a continuum of agents where the evolution of the epidemics is represented by an ODE system. In contrast with most of the existing literature, we allow the agents to make decisions and we incorporate game theoretical ideas in the model such as the notion of Nash equilibrium. When the population is homogeneous, this leads to a continuous time, finite state mean field game. We consider, from a mathematical viewpoint, mainly two questions: (1) How to find optimal public policies to reduce the impact of the epidemics while taking into account the agents' rational choices? (2) How to handle heterogeneities among the population while keeping a continuum of agents? For the first point, we use a Stackelberg mean field game model, while for the second point, we rely on the framework of graphon games. In each case, we develop numerical methods based on machine learning tools to efficiently compute approximately optimal solutions.

Class: 
Subject: 

On nonlocal interactions in mean field games - Part 1

Speaker: 
Levon Nurbekyan
Date: 
Fri, Oct 29, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

Numerous applications of mean-field games theory assume nonlocal interactions between agents. Although somewhat simpler from a mathematical analysis perspective, nonlocal models are often challenging for numerical solutions. Indeed, direct discretizations of mean-field interaction terms yield dense systems that are not economical from computational and memory perspectives. In this talk, I will discuss several options to mitigate the challenges above by importing methods from Fourier analysis and kernel methods in machine learning.

Part 2 of this talk continues here: https://mathtube.org/lecture/video/nonlocal-interactions-mean-field-game...

Class: 
Subject: 

On nonlocal interactions in mean field games - Part 2

Speaker: 
Levon Nurbekyan
Date: 
Fri, Oct 29, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

Numerous applications of mean-field games theory assume nonlocal interactions between agents. Although somewhat simpler from a mathematical analysis perspective, nonlocal models are often challenging for numerical solutions. Indeed, direct discretizations of mean-field interaction terms yield dense systems that are not economical from computational and memory perspectives. In this talk, I will discuss several options to mitigate the challenges above by importing methods from Fourier analysis and kernel methods in machine learning.

To go back to part 1 of the talk, click here: https://mathtube.org/lecture/video/nonlocal-interactions-mean-field-game...

Class: 
Subject: 

A case study on stochastic games on large graphs in mean field and sparse regimes

Speaker: 
Agathe Soret
Date: 
Fri, Oct 29, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

We study a class of linear-quadratic stochastic differential games in which each player interacts directly only with its nearest neighbors in a given graph. We find a semi-explicit Markovian equilibrium for any transitive graph, in terms of the empirical eigenvalue distribution of the graph’s normalized Laplacian matrix. This facilitates large-population asymptotics for various graph sequences, with several sparse and dense examples discussed in detail. In particular, the mean field game is the correct limit only in the dense graph case, i.e., when the degrees diverge in a suitable sense. Even though equilibrium strategies are nonlocal, depending on the behavior of all players, we use a correlation decay estimate to prove a propagation of chaos result in both the dense and sparse regimes, with the sparse case owing to the large distances between typical vertices. Without assuming the graphs are transitive, we show also that the mean field game solution can be used to construct decentralized approximate equilibria on any sufficiently dense graph sequence. This is joint work with Daniel Lacker.

Class: 
Subject: 

Pages