The Dyck bound in the concave 1-dimensional random assignment model

Abstract

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 $0<p<1$. Contrarily to the convex case $p>1$, where the optimal matching is trivially determined, here the optimization is non-trivial. The purpose of this paper is to introduce a special configuration, that we call the \emph{Dyck matching}, and to study its statistical properties. We compute exactly the average cost, in the asymptotic limit of large $N$, together with the first subleading correction. The scaling is remarkable: it is of order $N$ for $p<\frac{1}{2}$, order $N\ln N$ for $p=\frac{1}{2}$, and $N^{\frac{1}{2}+p}$ for $p>\frac{1}{2}$, and it is universal for a wide class of models. We conjecture that the average cost of the Dyck matching has the same scaling in $N$ as the cost of the optimal matching, and we produce numerical data in support of this conjecture. We hope to produce a proof of this claim in future work.

arXiv comment31 pages, 5 figures

References in corpus (17)

• RNA Folding and Large N Matrix Theory
• Statistical mechanics of secondary structures formed by random RNA sequences
• Scaling hypothesis for the Euclidean bipartite matching problem
• Glassy transition in a disordered model for the RNA secondary structure
• Enumeration of RNA structures by Matrix Models
• Statistical Physics of RNA-folding
• Scaling hypothesis for the Euclidean bipartite matching problem II. Correlation functions
• Zero Temperature Properties of RNA Secondary Structures
• Local matching indicators for transport problems with concave costs
• On the one dimensional Euclidean matching problem: exact solutions, correlation functions and universality
• Quadratic stochastic Euclidean bipartite matching problem
• Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle
• Random Euclidean matching problems in one dimension
• Finite-size corrections in the random assignment problem
• Planar diagrams from optimization
• Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
• Selberg integrals in 1D random Euclidean optimization problems

Cited by in corpus (1)

• The number of optimal matchings for Euclidean Assignment on the line