Zobrazeno 1 - 10
of 195
pro vyhledávání: '"Sergio Caracciolo"'
Publikováno v:
Journal of Statistical Physics
Journal of Statistical Physics, 2019, 174 (4), pp.846-864. ⟨10.1007/s10955-018-2212-9⟩
Journal of Statistical Physics, 2019, 174 (4), pp.846-864. ⟨10.1007/s10955-018-2212-9⟩
We consider the random Euclidean assignment problem on the line between two sets of $N$ random points, independently generated with the same probability density function $\varrho$. The cost of the matching is supposed to be dependent on a power $p>1$
Publikováno v:
Journal of Statistical Physics
Journal of Statistical Physics, Springer Verlag, 2021, 183 (1), ⟨10.1007/s10955-021-02741-1⟩
Journal of Statistical Physics, Springer Verlag, 2021, 183 (1), ⟨10.1007/s10955-021-02741-1⟩
We consider the Random Euclidean Assignment Problem in dimension $$d=1$$ d = 1 , with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af0543735e174f36528c7e6eb625e879
https://hal.archives-ouvertes.fr/hal-03204820/document
https://hal.archives-ouvertes.fr/hal-03204820/document
Autor:
R. Fabbricatore, Raffaele Marino, Sergio Caracciolo, Gabriele Sicuro, Marco Gherardi, Giorgio Parisi
Publikováno v:
Physical review. E. 103(4-1)
In critical systems, the effect of a localized perturbation affects points that are arbitrarily far from the perturbation location. In this paper, we study the effect of localized perturbations on the solution of the random dimer problem in $2D$. By
Autor:
Matteo d'Achille, Emanuele Caglioti, Gabriele Sicuro, Dario Benedetto, Sergio Caracciolo, Andrea Sportiello
Publikováno v:
Benedetto, D, Caglioti, E, Caracciolo, S, D’Achille, M, Sicuro, G & Sportiello, A 2021, ' Random Assignment Problems on 2d Manifolds ', Journal of Statistical Physics, vol. 183, no. 2, 34, pp. 1-40 . https://doi.org/10.1007/s10955-021-02768-4
Journal of Statistical Physics
Journal of Statistical Physics, 2021, 183 (34), ⟨10.1007/s10955-021-02768-4⟩
HAL
In press
Journal of Statistical Physics
Journal of Statistical Physics, 2021, 183 (34), ⟨10.1007/s10955-021-02768-4⟩
HAL
In press
We consider the assignment problem between two sets of $N$ random points on a smooth, two-dimensional manifold $\Omega$ of unit area. It is known that the average cost scales as $E_{\Omega}(N)\sim\frac{1}{2\pi}\ln N$ with a correction that is at most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ab4a1aea9396552356e53d237406abf
http://arxiv.org/abs/2008.01462
http://arxiv.org/abs/2008.01462
Autor:
Sergio Caracciolo, Mauro Pastore
Publikováno v:
Proceedings of XIII Quark Confinement and the Hadron Spectrum — PoS(Confinement2018).
In the Wilson's lattice formulation of QCD, a fermionic Fock space of states can be explicitly built at each time slice using canonical creation and annihilation operators. The partition function $Z$ is then represented as the trace of the transfer m
The traveling-salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We study the traveling salesman problem when the positions of the cities are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bfe86363339731c43da2d6773f3ceda
http://hdl.handle.net/11565/4029520
http://hdl.handle.net/11565/4029520
Publikováno v:
Journal of Physics A General Physics (1968-1972)
Journal of Physics A General Physics (1968-1972), Institute of Physics (IOP), In press
HAL
Journal of Physics A General Physics (1968-1972), Institute of Physics (IOP), In press
HAL
We consider models of assignment for random $N$ blue points and $N$ red points on an interval of length $2N$, in which the cost for connecting a blue point in $x$ to a red point in $y$ is the concave function $|x-y|^p$, for $01$, where the optimal ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c05bc04b66dc385de81c9705c1eb134f
Publikováno v:
Physical review / E 98(3), 030101 (2018). doi:10.1103/PhysRevE.98.030101
We show that the average optimal cost for the traveling salesman problem in two dimensions, which is the archetypal problem in combinatorial optimization, in the bipartite case, is simply related to the average optimal cost of the assignment problem
The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost funct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::603be3e1391c58c5817c7a3555a477bf
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one does not ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8434a3f6b22227fa28fe9a73f6e09a54
http://hdl.handle.net/11565/4029514
http://hdl.handle.net/11565/4029514