Related papers: Shrinking targets and eventually always hitting po…
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…
The convergence of expectation-maximization (EM)-based algorithms typically requires continuity of the likelihood function with respect to all the unknown parameters (optimization variables). The requirement is not met when parameters…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
The Bayesian formulation of inverse problems is attractive for three primary reasons: it provides a clear modelling framework; means for uncertainty quantification; and it allows for principled learning of hyperparameters. The posterior…
Let $(X,T,\mu,d)$ be a metric measure-preserving system. If $B(x,r_n(x))$ is a sequence of balls such that, for each $n$, the measure of $B(x,r_n(x))$ is constant, then we obtain a self-norming CLT for recurrence for systems satisfying a…
We prove a new result in the area of hitting time statistics. Currently, there is a lot of papers showing that the first entry times into cylinders or balls are often faster than the Birkhoff's Ergodic Theorem would suggest. We provide an…
Geometric matching is an important topic in computational geometry and has been extensively studied over decades. In this paper, we study a geometric-matching problem, known as geometric many-to-many matching. In this problem, the input is…
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…
The double-exponential Sinc-collocation method is known as a super-accurate method for solving initial value problems of ordinary differential equations, for which the error decreases almost exponentially as a function of the number of…
We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting: given a graph $G$ and a set $\mathcal{F}$ of forbidden graphs, the goal is to compute a minimum-sized set $S$ of vertices of $G$ such that $G-S$ does…
Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…
Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
Let $A$ be an invertible $d\times d$ matrix with integer elements. Then $A$ determines a self-map $T$ of the $d$-dimensional torus $\mathbb{T}^d=\mathbb{R}^d/\mathbb{Z}^d$. Given a real number $\tau>0$, and a sequence $\{z_n\}$ of points in…
Suppose $(f,\mathcal{X},\mu)$ is a measure preserving dynamical system and $\phi \colon \mathcal{X} \to \mathbb{R}$ a measurable function. Consider the maximum process $M_n:=\max\{X_1 \ldots,X_n\}$, where $X_i=\phi\circ f^{i-1}$ is a time…
We study countably piecewise continuous, piecewise monotone interval maps. We establish a necessary and sufficient criterion for the existence of a nondecreasing semiconjugacy to a map of constant slope in terms of the existence of an…
Two-time-scale stochastic approximation algorithms are iterative methods used in applications such as optimization, reinforcement learning, and control. Finite-time analysis of these algorithms has primarily focused on fixed point…
We study the \emph{{interval completion}} problem, which asks for the insertion of a set of at most $k$ edges to make a graph of $n$ vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every…
In this study, we propose an algorithmic framework for solving a class of optimal control problems. This class is associated with the minimum-time interception of moving target problems, where a plant with a given state equation must…
The statistical measure of spatial inhomogeneity for n points placed in chi cells each of size kxk is generalized to incorporate finite size objects like black pixels for binary patterns of size LxL. As a function of length scale k, the…