Lower bounds for the sparse travelling salesman constant of Aldous and Krikun
Let T_m be the length of the shortest path from the origin through m distinct points of a Poisson process of unit intensity in ℝ^d, d ≥ 2. Aldous and Krikun proved that T_m/m converges in probability to a constant c(0+) > 0, the sparse travelling salesman constant. We prove c(0+) > 0.32417 for d = 2. The exponential tilt of Aldous and Krikun gives c(0+) ≥ b_d = (d/e)(v_d·d!)^(−1/d), where v_d is the volume of the unit ball, and b_2 = 0.29352... For every a > b_d the expected number of paths of length at most am through m points tends to infinity, so no first moment of the number of all such paths gives more. We count only the paths that no exchange of two consecutive points shortens, and bound their expected number through the powers of a transfer operator P, a non-negative matrix on 602,176 states, which has a positive integer vector ω with Pω ≤ 0.81987·ω. Code and data: https://github.com/yspennstate/sparse-tsp-constant-lower-bound
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-22
- DOI
- https://doi.org/10.5281/zenodo.24430152
- Primary Topic
- Point processes and geometric inequalities
- Type
- preprint