Related papers: Pi Visits Manhattan
Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…
The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula $C$, are well-known {\it NP}-complete problems. Here we…
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
We consider a path-planning scenario for a mobile robot traveling in a configuration space with obstacles under the presence of stochastic disturbances. A novel path length metric is proposed on the uncertain configuration space and then…
This paper is aimed to study the ergodic short-term behaviour of discretizations of circle expanding maps. More precisely, we prove some asymptotics of the distance between the $t$-th iterate of Lebesgue measure by the dynamics $f$ and the…
The domain-independent universal Normalized Information Distance based on Kolmogorov complexity has been (in approximate form) successfully applied to a variety of difficult clustering problems. In this paper we investigate theoretical…
The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…
In this paper we deal with the analysis of the solutions of traffic flow models at multiple scales, both in the case of a single road and of road networks. We are especially interested in measuring the distance between traffic states (as…
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path…
Motivated by the problem of exploring discrete but very complex state spaces in Bayesian models, we propose a novel Markov Chain Monte Carlo search algorithm: the taxicab sampler. We describe the construction of this sampler and discuss how…
We show that there are separated nets in the Euclidean plane which are not biLipschitz equivalent to the integer lattice. The argument is based on the construction of a continuous function which is not the Jacobian of a biLipschitz map.
In a 2D conservative Hamiltonian system there is a formal integral $\Phi$ besides the energy H. This is not convergent near a stable periodic orbit, but it is convergent near an unstable periodic orbit. We explain this difference and we…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
In ``Characterization, stability and convergence of hierarchical clustering methods'' by G. E. Carlsson, F. Memoli, the natural way to construct an ultrametric space from a given metric space was presented. It was shown that the…
Analytically tractable dynamical systems exhibiting a whole range of normal and anomalous deterministic diffusion are rare. Here we introduce a simple non-chaotic model in terms of an interval exchange transformation suitably lifted onto…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
We discuss measures on spaces of unparametrized paths related to the Wiener measure. These measures arise naturally in the study of one-dimensional gravity coupled to scalar fields. Two kinds of discrete approximations are defined, the…
We prove that if two finitely generated groups act on a metrically complete 2-dimensional Euclidean building, then the distance between their fixed-point sets is realised. Our proof uses the geometry of Euclidean buildings, which we view as…
Let D be a digraph and C be a cycle in D. For any two vertices x and y in D, the distance from x to y is the minimum length of a path from x to y. We denote the square of Let $D$ be a digraph and $C$ be a cycle in $D$. For any two vertices…