The diminishing segment process
Gergely Ambrus, P\'eter Kevei, Viktor V\'igh

TL;DR
This paper studies a recursive process of intersecting segments with randomly chosen points, proving convergence in distribution of the segment radius and characterizing the limiting distribution of the center.
Contribution
It introduces a novel recursive segment process and proves the asymptotic distribution of the segment radius and center.
Findings
Segment radius scaled by n converges to an exponential distribution.
Center of the limiting segment follows an arcsine distribution.
Provides rigorous probabilistic analysis of the process.
Abstract
Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) is chosen randomly on the segment S(n) with uniform distribution. For the radius r(n) of S(n) we prove that n(r(n) - 1//2) converges in distribution to an exponential law, and we also show that the centre of the limiting unit interval has arcsine distribution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Bayesian Methods and Mixture Models · Stochastic processes and statistical mechanics
