题 目：Hamilton–Jacobi equations on networks
报告人：Antonio Siconolfi (University of Rome, “La Sapienza”)
摘 要：We consider stationary and time–dependent HJ equations posed on networks. We provide a unified definition of solution and give comparison principles and representation formulae. We perform some qualitative analysis and define an appropriate Aubry set for the Eikonal and discounted case.
The peculiarity of the approach we propose is to introduce an associate discrete equation on an underlying abstract graph. It allows, among other things, to get the comparison result through simple combinatorial techniques bypassing Crandall–Lions doubling variable method.
时 间: 2018年6月18日（星期一）15:00–16:00
地 点: 蒙民伟楼1105报告厅