Abstract:We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration at the natural energy scale $n^{1-p/d}$ for $1\le p<d^2/2$. Our method combines a Poincaré inequality with a robust geometric mechanism providing uniform bounds on the edges of optimizers. We also formulate a conjectural $p\!\to\!q$ transfer principle for the $p$--optimal matching which, if true, would extend the concentration range to all $p\ge 1$.
From: Francesco Mattesini [view email]
[v1]
Wed, 25 Feb 2026 12:28:23 UTC (69 KB)
[v2]
Wed, 4 Mar 2026 14:44:43 UTC (207 KB)
[v3]
Wed, 9 Sep 2026 12:16:41 UTC (207 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。