Gabriele Sicuro

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching problem between points randomly distributed on a d-dimensional Euclidean space, where the cost to minimize depends on the(More)
We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic prediction of the large N limit of the average cost in dimension d = 1,2 and of the subleading correction in higher(More)
  • 1