# Antonio Siconolfi

## Contact Details

NameAntonio Siconolfi |
||

Affiliation |
||

Location |
||

## Pubs By Year |
||

## Pub CategoriesMathematics - Analysis of PDEs (8) Mathematics - Dynamical Systems (3) Mathematics - Probability (2) Mathematics - Optimization and Control (2) |

## Publications Authored By Antonio Siconolfi

We study a class of weakly coupled systems of Hamilton{Jacobi equations at the critical level. We associate to it a family of scalar discounted equation. Using control{theoretic tech- niques we construct an algorithm which allows obtaining a critical solution to the system as limit of a monotonic sequence of subsolutions. Read More

We study a one-parameter family of Eikonal Hamilton-Jacobi equations on an embedded network, and prove that there exists a unique critical value for which the corresponding equation admits global solutions, in a suitable viscosity sense. Such a solution is identified, via an Hopf-Lax type formula, once an admissible trace is assigned on an intrinsic boundary. The salient point of our method 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. Read More

Following the random approach of Mitake, Siconolfi,Tran and Yamada, we define a Lax--Oleinik formula adapted to evolutive weakly coupled systems of Hamilton--Jacobi equations. It is reminiscent of the corresponding scalar formula, with the relevant difference that it has a stochastic character since it involves, loosely speaking, random switchings between the various associated Lagrangians. We prove that the related value functions are viscosity solutions to the system, and establish existence of minimal random curves under fairly general hypotheses. Read More

We study a class of weakly coupled systems of Hamilton-acobi equations using the random frame introduced in a previous paper of Mitake-Siconolfi-Tran-Yamada. We provide a cycle condition characterizing the points of Aubry set. This generalizes a property already known in the scalar case. Read More

We deal with a singularly perturbed optimal control problem with slow and fast variable depending on a parameter {\epsilon}. We study the asymptotic, as {\epsilon} goes to 0, of the corresponding value functions, and show convergence, in the sense of weak semilimits, to sub and supersolution of a suitable limit equation containing the effective Hamiltonian. The novelty of our contribution is that no compactness condition are assumed on the fast variable. Read More

We describe a setting for homogenization of convex hamiltonians on abelian covers of any compact manifold. In this context we also provide a simple variational proof of standard homogenization results. Read More

We prove that any continuous and convex stationary ergodic Hamiltonian admits critical subsolutions, which are strict outside the random Aubry set. They make up, in addition, a dense subset of all critical subsolutions with respect to a suitable metric. If the Hamiltonian is additionally assumed of Tonelli type, then there exist strict subsolutions of class $\CC^{1,1}$ in $\R^N$. Read More

We adapt the metric approach to the study of stationary ergodic Hamilton-Jacobi equations, for which a notion of admissible random (sub)solution is defined. For any level of the Hamiltonian greater than or equal to a distinguished critical value, we define an intrinsic random semidistance and prove that an asymptotic norm does exist. Taking as source region a suitable class of closed random sets, we show that the Lax formula provides admissible subsolutions. Read More

We perform a qualitative analysis of the critical equation associated with a stationary ergodic Hamiltonian through a stochastic version of the metric method, where the notion of closed random stationary set, issued from stochastic geometry, plays a major role. Our purpose is to give an appropriate notion of random Aubry set, to single out characterizing conditions for the existence of exact or approximate correctors, and write down representation formulae for them. For the last task, we make use of a Lax--type formula, adapted to the stochastic environment. Read More