The Dyck bound in the concave 1-dimensional random assignment model
From MaRDI portal
Publication:5870421
DOI10.1088/1751-8121/ab4a34OpenAlexW4289049826MaRDI QIDQ5870421
Andrea Sportiello, Matteo D'Achille, Vittorio Erba, Sergio Caracciolo
Publication date: 9 January 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.10867
Related Items
On a Solution to the Monge Transport Problem on the Real Line Arising from the Strictly Concave Case, The number of optimal matchings for Euclidean assignment on the line, Sampled Gromov Wasserstein, Minimal matchings of point processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On optimal matchings
- Scaling and non-standard matching theorems
- A PDE approach to a 2-dimensional matching problem
- Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
- The ?(2) limit in the random assignment problem
- Local Matching Indicators for Transport Problems with Concave Costs
- Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle
- Exact solutions to the transportation problem on the line
- Constructive bounds and exact expectations for the random assignment problem
- One-dimensional empirical measures, order statistics, and Kantorovich transport distances
- Completing a (k − 1)-Assignment
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- RNA folding and large \(N\) matrix theory