Correlation function for the grid-Poisson Euclidean matching on a line and on a circle

DOI10.1088/1742-5468/2014/11/P11023MaRDI QIDQ3301809zbMATH OpenFDO

Authors Elena Boniolo, Andrea Sportiello, Sergio Caracciolo

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Programming involving graphs or networks (90C35) Matching models (91B68)

Abstract: We compute the two-point correlation function for spin configurations which are obtained by solving the Euclidean matching problem, for one family of points on a grid, and the second family chosen uniformly at random, when the cost depends on a power $p$ of the Euclidean distance. We provide the analytic solution in the thermodynamic limit, in a number of cases ($p>1$ open b.c. and $p=2$ periodic b.c., both at criticality), and analyse numerically other parts of the phase diagram.

Recommendations

• The Euclidean Matching Problem
• scientific article; zbMATH DE number 434648
• Convergence of asymptotic costs for random Euclidean matching problems
• The number of optimal matchings for Euclidean assignment on the line
• An Optimal Matching Problem for the Euclidean Distance

Cites work

• scientific article; zbMATH DE number 1273988 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Algorithms for the Assignment and Transportation Problems
• Information, Physics, and Computation
• Minimax grid matching and empirical measures
• On optimal matchings
• Poisson matching
• Probability. Theory and examples.
• The \(\zeta(2)\) limit in the random assignment problem
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms

Cited in

(6)

• The Dyck bound in the concave 1-dimensional random assignment model
• Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
• The number of optimal matchings for Euclidean assignment on the line
• Random assignment problems on 2d manifolds
• Average optimal cost for the Euclidean TSP in one dimension
• Minimal matchings of point processes

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: Correlation function for the grid-Poisson Euclidean matching on a line and on a circle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301809)