Metraipolis › archive › dc_679dc1fdd238

A geometrically linear approximation of min-max optimal matching — arXiv:2609.08680

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08680
License (as archived)
CC0-1.0
Archived
2026-10-16T14:35:16.234Z
SHA-256 of the archived text
d70685a543ab0dcb0dd7ca7d67b1f4f124224d235fb0b1e759d8142f23615fdb
Stable URL of this page
https://metraipolis.com/documento/dc_679dc1fdd238

How to cite

A geometrically linear approximation of min-max optimal matching — arXiv:2609.08680 — arXiv (en), https://arxiv.org/abs/2609.08680 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_679dc1fdd238 (Metraipolis archive dc_679dc1fdd238, sha256 d70685a543ab0dcb0dd7ca7d67b1f4f124224d235fb0b1e759d8142f23615fdb)
BibTeX
@misc{dc679dc1fdd238,
  title = {A geometrically linear approximation of min-max optimal matching — arXiv:2609.08680},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08680},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_679dc1fdd238; sha256 d70685a543ab0dcb0dd7ca7d67b1f4f124224d235fb0b1e759d8142f23615fdb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08680. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this work we establish a connection between the min-max optimal matching in the critical dimension $d=2$ and a simpler, geometrically linear, action of random curves in a Brownian potential. This is done by following Leighton and Shor and working with the dual formulation, which we approximate by a problem of isoperimetric-type with a random volume term of white-noise character. This allows us to extract the leading-order term in the asymptotics of the expected cost, sharpening previous results.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.08680 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:09:59.802Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).