arXiv · cond-mat/0507180
Random multi-index matching problems
Abstract
The multi-index matching problem (MIMP) generalizes the well known matching problem by going from pairs to d-uplets. We use the cavity method from statistical physics to analyze its properties when the costs of the d-uplets are random. At low temperatures we find for d>2 a frozen glassy phase with vanishing entropy. We also investigate some properties of small samples by enumerating the lowest cost matchings to compare with our theoretical predictions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
O. C. Martin, M. Mezard, O. Rivoire. 2005-07-07. Random multi-index matching problems. https://doi.org/10.1088/1742-5468%2F2005%2F09%2Fp09006
Cite the original work for its findings. Save a collection to share your selection of sources.