3 papers
math.PR2026
Concentration for random Euclidean combinatorial optimization
Matteo D'Achille, Francesco Mattesini, Dario Trevisan
We prove concentration bounds for random Euclidean combinatorial optimization problems with --costs. For bipartite matching and for the (mono- and bi-partite) traveling salesper…
math.PR2024
Viscosity solutions of Hamilton-Jacobi equation in spaces and applications to large deviations
Nicola Gigli, Luca Tamanini, Dario Trevisan
The aim of this paper is twofold. - In the setting of RCD(K,) metric measure spaces, we derive uniform gradient and Laplacian contraction estimates along solutions of the v…
quant-ph2024
The generalized strong subadditivity of the von Neumann entropy for bosonic quantum systems
Giacomo De Palma, Dario Trevisan
We prove a generalization of the strong subadditivity of the von Neumann entropy for bosonic quantum Gaussian systems. Such generalization determines the minimum values of linear c…