Related papers: Almost sure orbits closeness
Given a finite metric space $(V,d)$, an approximate distance oracle is a data structure which, when queried on two points $u,v \in V$, returns an approximation to the the actual distance between $u$ and $v$ which is within some bounded…
The reachable set of controlled dynamical systems consist of the set of all possible reachable states from an initial condition, over a certain period of time under various control and operation constraints and exogenous disturbances. For…
The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications…
The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…
Metrics on the space of sets of trajectories are important for scientists in the field of computer vision, machine learning, robotics, and general artificial intelligence. However, existing notions of closeness between sets of trajectories…
Observations of exoplanets have revealed that systems with planets on closely-spaced orbits are common, which motivates the question "How closely can planets orbit to one another and still be dynamically-stable for very long times?". To…
One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact…
The Wasserstein distance between two probability measures on a metric space is a measure of closeness with applications in statistics, probability, and machine learning. In this work, we consider the fundamental question of how quickly the…
We present a simple dynamical systems model for the effect of invisible space dimensions on the visible ones. There are three premises. A: Orbits consist of flows of probabilities [P].which is the case in the setting of quantum mechanics.…
The computation of the Minimum Orbital Intersection Distance (MOID) is an old, but increasingly relevant problem. Fast and precise methods for MOID computation are needed to select potentially hazardous asteroids from a large catalogue. The…
Consider the stationary measure of open asymmetric simple exclusion process (ASEP) on the lattice $\{1,\dots,n\}$. Taking $n$ to infinity while fixing the jump rates, this measure converges to a measure on the semi-infinite lattice. In the…
Determining the reachable set for a given nonlinear control system is crucial for system control and planning. However, computing such a set is impossible if the system's dynamics are not fully known. This paper is motivated by a scenario…
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…
It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask…
We are interested in the asymptotic behaviour of the first return time of the orbits of a dynamical system into a small neighbourhood of their starting points. We study this quantity in the context of dynamical systems preserving an…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
We test a crossing orbit stability criterion for eccentric planetary systems, based on Wisdom's criterion of first order mean motion resonance overlap (Wisdom, 1980). We show that this criterion fits the stability regions in real exoplanet…
We consider the Keplerian distance $d$ in the case of two elliptic orbits, i.e. the distance between one point on the first ellipse and one point on the second one, assuming they have a common focus. The absolute minimum $d_{\rm min}$ of…
Whether there is similarity between two physical processes in the movement of objects and the complexity of behavior is an essential problem in science. How to seek similarity through the adoption of quantitative and qualitative research…
The min-distance between two nodes $u, v$ is defined as the minimum of the distance from $v$ to $u$ or from $u$ to $v$, and is a natural distance metric in DAGs. As with the standard distance problems, the Strong Exponential Time Hypothesis…