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 have the unique loop condition. We consider this problem both on the complete bipartite and complete graph embedded in a one dimensional interval, the weights being chosen as a convex function of the Euclidean distance between each couple of points. Randomness is introduced throwing independently and uniformly the points in space. We derive the average optimal cost in the limit of large number of points. We prove that the possible solutions are characterized by the presence of "shoelace" loops containing 2 or 3 points of each type in the complete bipartite case, and 3, 4 or 5 points in the complete one. This gives rise to an exponential number of possible solutions scaling as p^N , where p is the plastic constant. This is at variance to what happens in the previously studied one-dimensional models such as the matching and the traveling salesman problem, where for every instance of the disorder there is only one possible solution.

Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension / S. Caracciolo, A. Di Gioacchino, E.M. Malatesta. - In: JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT. - ISSN 1742-5468. - 2018:8(2018 Aug 10).

Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension

S. Caracciolo
Primo
;
A. Di Gioacchino
Secondo
;
E.M. Malatesta
Ultimo
2018

Abstract

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 have the unique loop condition. We consider this problem both on the complete bipartite and complete graph embedded in a one dimensional interval, the weights being chosen as a convex function of the Euclidean distance between each couple of points. Randomness is introduced throwing independently and uniformly the points in space. We derive the average optimal cost in the limit of large number of points. We prove that the possible solutions are characterized by the presence of "shoelace" loops containing 2 or 3 points of each type in the complete bipartite case, and 3, 4 or 5 points in the complete one. This gives rise to an exponential number of possible solutions scaling as p^N , where p is the plastic constant. This is at variance to what happens in the previously studied one-dimensional models such as the matching and the traveling salesman problem, where for every instance of the disorder there is only one possible solution.
Physics - Disordered Systems and Neural Networks; Physics - Disordered Systems and Neural Networks
Settore FIS/02 - Fisica Teorica, Modelli e Metodi Matematici
Article (author)
File in questo prodotto:
File Dimensione Formato  
p173.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 1.03 MB
Formato Adobe PDF
1.03 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/586105
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact