Maximal Minimal Spacing for Random Points.

Authors

Fabio Deelan Cunden, Noemi Cuppone, Giovanni Gramegna, Pierpaolo Vivo

Published in

Journal of statistical physics. Volume 193. Issue 9. Pages 118. Epub Aug 27, 2026.

Abstract

From $N+1$ random points on a line we wish to select $M+1$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. Equivalently, the points are arrival times of a generic renewal process. For general spacing distributions, and for all $M\le N$ , we derive exact distributional identities for the maximal minimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive random increments and is reset to the origin upon exceeding a fixed threshold. The probability that the optimal spacing exceeds a given value coincides with the probability that the walk completes at least M reset cycles within N steps. This yields an exact representation in terms of first-passage functionals of the walk. The same mapping suggests a numerical scheme for the max-min spacing problem in the regime of large N and M, whose accuracy is tested against the exact results obtained here.

PMID:
42666375
Bibliographic data and abstract were imported from PubMed on 29 Aug 2026.

Read full publication at:
Please sign in to see all details.

Stats

1-terrible, 9-excellent. How would you rate this publication? Sign in in to submit your rating.

Post a comment

You need to be signed in to post comments. You can sign in here.

Comments

There are no comments yet.