学术报告

【online】The Hamilton–Jacobi equation on networks: weak KAM and Aubry–Mather theories

发布人:发布时间: 2021-01-21

字体大小: 【小】 【中】 【大】

题目: The Hamilton–Jacobi equation on networks: weak KAM and Aubry–Mather theories

 

报告人: Alfonso Sorrentino(University of Rome Tor Vergata)

 

时间: 2021年01月29日 16:00-17:00


方式: Zoom APP   ID:662 5511 4145  密码:609617


摘要:Over the last years there has been an increasing interest in the study of the Hamilton–Jacobi Equation on networks and related questions. These problems, in fact, involve a number of subtle theoretical issues and have a great impact in the applications in various fields, for example to data transmission, traffic management problems, etc… While locally — i.e., on each branch of the network (arcs) —, the study reduces to the analysis of 1-dimensional problems, the main difficulties arise in matching together the information converging at the juncture of two or more arcs, and relating the local analysis at a juncture with the global structure/topology of the network.

 

In this talk I shall discuss several results related to the global analysis of this problem, obtained in collaboration with Antonio Siconolfi (Univ. of Rome La Sapienza); more specifically, we developed analogues of the so-called Weak KAM theory and Aubry–Mather theory in this setting. The salient point of our approach is to associate to the network an abstract graph, encoding all of the information on the complexity of the network, and to relate the differential equation to a discrete functional equation on the graph.


邀请人:程伟  老师