An official website of the United States government
Let \begin{document}$$ \mathscr{M} $$\end{document} be a geometrically finite hyperbolic manifold. We present a very general theorem on the shrinking target problem for the geodesic flow, using its exponential mixing. This includes a strengthening of Sullivan's logarithm law for the excursion rate of the geodesic flow. More generally, we prove logarithm laws for the first hitting time for shrinking cusp neighborhoods, shrinking tubular neighborhoods of a closed geodesic, and shrinking metric balls, as well as give quantitative estimates for the time a generic geodesic spends in such shrinking targets.
more »
« less
Zero–one laws for eventually always hitting points in rapidly mixing systems
In this work we study the set of eventually always hitting points in shrinking target systems. These are points whose long orbit segments eventually hit the corresponding shrinking targets for all future times. We focus our attention on systems where translates of targets exhibit near perfect mutual independence, such as Bernoulli schemes and the Gauß map. For such systems, we present tight conditions on the shrinking rate of the targets so that the set of eventually always hitting points is a null set (or co-null set respectively).
more »
« less
- Award ID(s):
- 2155111
- PAR ID:
- 10525708
- Publisher / Repository:
- International Press
- Date Published:
- Journal Name:
- Mathematical Research Letters
- Volume:
- 30
- Issue:
- 3
- ISSN:
- 1073-2780
- Page Range / eLocation ID:
- 765 to 805
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract In the study of some dynamical systems the limsup set of a sequence of measurable sets is often of interest. The shrinking targets and recurrence are two of the most commonly studied problems that concern limsup sets. However, the zero–one laws for the shrinking targets and recurrence are usually treated separately and proved differently. In this paper, we introduce a generalized definition that can specialize into the shrinking targets and recurrence; our approach gives a unified proof of the zero–one laws for the two problems.more » « less
-
Abstract A variety of systems in physics, chemistry, biology, and psychology are modeled in terms of diffusing ‘searchers’ looking for ‘targets’. Examples range from gene regulation, to cell sensing, to human decision-making. A commonly studied statistic in these models is the so-called hitting probability for each target, which is the probability that a given single searcher finds that particular target. However, the decisive event in many systems is not the arrival of a given single searcher to a target, but rather the arrival of the fastest searcher to a target out of many searchers. In this paper, we study the probability that the fastest diffusive searcher hits a given target in the many searcher limit, which we call the extreme hitting probability. We first prove an upper bound for the decay of the probability that the searcher finds a target other than the closest target. This upper bound applies in very general settings and depends only on the relative distances to the targets. Furthermore, we find the exact asymptotics of the extreme hitting probabilities in terms of the short-time distribution of when a single searcher hits a target. These results show that the fastest searcher always hits the closest target in the many searcher limit. While this fact is intuitive in light of recent results on the time it takes the fastest searcher to find a target, our results give rigorous, quantitative estimates for the extreme hitting probabilities. We illustrate our results in several examples and numerical solutions.more » « less
-
We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While their static versions have been extensively studied in the past, surprisingly little is known about dynamic geometric set cover and hitting set. For instance, even for the most basic case of one-dimensional interval set cover and hitting set, no nontrivial results were known. The main contribution of our paper are two frameworks that lead to efficient data structures.more » « less
-
Kráľovič, Rastislav; Kučera, Antonín (Ed.)Given a set P of n points and a set S of m disks in the plane, the disk hitting set problem asks for a smallest subset of P such that every disk of S contains at least one point in the subset. The problem is NP-hard. This paper considers a line-constrained version in which all disks have their centers on a line. We present an O(mlog²n+(n+m)log(n+m)) time algorithm for the problem. This improves the previous result of O(m²log m+(n+m)log(n+m)) time for the weighted case of the problem where every point of P has a weight and the objective is to minimize the total weight of the hitting set. Our algorithm also solves a more general line-separable problem with a single intersection property: The points of P and the disk centers are separated by a line 𝓁 and the boundary of every two disks intersect at most once on the side of 𝓁 containing P.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.4310/MRL.2023.v30.n3.a7
