Correlation function for the grid-Poisson Euclidean matching on a line and on a circle
DOI10.1088/1742-5468/2014/11/P11023zbMATH Open1456.91064arXiv1403.1836MaRDI QIDQ3301809FDOQ3301809
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
Recommendations
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Programming involving graphs or networks (90C35) Matching models (91B68)
Cites Work
- Title not available (Why is that?)
- Probability. Theory and examples.
- On optimal matchings
- Title not available (Why is that?)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- The \(\zeta(2)\) limit in the random assignment problem
- Minimax grid matching and empirical measures
- Algorithms for the Assignment and Transportation Problems
- Poisson matching
- Information, Physics, and Computation
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
Uses Software
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)