Hitting Probabilities and the Ekstr{\"o}m-Persson conjecture
Esa J\"arvenp\"a\"a, Markus Myllyoja, St\'ephane Seuret (UPEC UP12)

TL;DR
This paper advances the understanding of the Ekstr{"o}m-Persson conjecture by developing a new approach that establishes the conjectured Hausdorff dimension as a lower bound for random covering sets, with implications for hitting probabilities.
Contribution
The paper introduces a novel method to prove the lower bound of the Hausdorff dimension in the Ekstr{"o}m-Persson conjecture, extending results to more general limsup sets and hitting probability questions.
Findings
Confirmed the conjectured Hausdorff dimension as a lower bound for random covering sets.
Extended the analysis to more general limsup sets.
Determined conditions under which deterministic sets are hit by random coverings.
Abstract
We consider the Ekst\''om-Persson conjecture concerning the value of the Hausdorff dimension of random covering sets formed by balls with radii and centres chosen independently at random according to an arbitrary Borel probability measure on . The conjecture has been solved positively in the case , where stands for the upper Hausdorff dimension of . In this paper, we develop a new approach in order to answer the full conjecture, proving in particular that the conjectured value is only a lower bound for the dimension. Our approach opens the way to study more general limsup sets, and has consequences on the so-called hitting probability questions. For instance, we are able to determine whether and what part of a deterministic analytic set can be hit by random covering sets…
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
TopicsStatistical Mechanics and Entropy
