The number of optimal matchings for Euclidean assignment on the line

DOI10.1007/s10955-021-02741-1zbMath1470.60018arXiv2101.04926OpenAlexW3136197258WikidataQ114225326 ScholiaQ114225326MaRDI QIDQ2020627

Vittorio Erba, Sergio Caracciolo, Andrea Sportiello

Publication date: 23 April 2021

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.04926

zbMATH Keywords

assignment problemEuclidean correlationsrandom combinatorial optimization

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items (1)

Minimal matchings of point processes

Cites Work

• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Transport inequalities on Euclidean spaces for non-Euclidean metrics
• Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
• Singularity analysis, Hadamard products, and tree recurrences
• Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle
• Exact solutions to the transportation problem on the line
• On a Solution to the Monge Transport Problem on the Real Line Arising from the Strictly Concave Case
• Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems
• The Dyck bound in the concave 1-dimensional random assignment model

This page was built for publication: The number of optimal matchings for Euclidean assignment on the line