Related papers: A canonical parameterization of paths in $\mathbb{…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
We introduce a new distance and we use it to parameter estimation purposes. We observe how it operates and we use in its place the usual methods of estimation which we call the methods of the new approach. We realize that we obtain a…
We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates pairwise (customizable) relations among features, dealing with relevance and…
Some possible definitions for the natural parametrization of SLE (Schramm-Loewner evolution) paths are proposed in terms of various limits. One of the definitions is used to give a new proof of the Hausdorff dimension of SLE paths.
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
The problem of listing the $K$ shortest simple (loopless) $st$-paths in a graph has been studied since the early 1960s. For a non-negatively weighted graph with $n$ vertices and $m$ edges, the most efficient solution is an $O(K(mn + n^2…
Real-world road networks have an approximate scale-invariance property; can one devise mathematical models of random networks whose distributions are {\em exactly} invariant under Euclidean scaling? This requires working in the continuum…
Starting from the canonical formalism of relativistic (timeless) quantum mechanics, the formulation of timeless path integral is rigorously derived. The transition amplitude is reformulated as the sum, or functional integral, over all…
In the spirit of Marcus canonical stochastic differential equations, we study a similar notion of rough differential equations (RDEs), notably dropping the assumption of continuity prevalent in the rough path literature. A new metric is…
We introduce the class of "smooth rough paths" and study their main properties. Working in a smooth setting allows us to discard sewing arguments and focus on algebraic and geometric aspects. Specifically, a Maurer-Cartan perspective is the…
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…
Many real world networks (graphs) are observed to be 'small worlds', i.e., the average path length among nodes is small. On the other hand, it is somewhat unclear what other average path length values networks can produce. In particular, it…
It was recently claimed that on d-dimensional small-world networks with a density p of shortcuts, the typical separation s(p) ~ p^{-1/d} between shortcut-ends is a characteristic length for shortest-paths{cond-mat/9904419}. This contradicts…
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
A system of identical cars on a single-lane road is treated as a microcanonical and canonical ensemble. Behaviour of the cars is characterized by the probability of car velocity as a function of distance and velocity of the car ahead. The…
We construct a family F of compact and pathwise connected subsets of the Euclidean plane such that (i) the cardinality of F is that of the continuum (and hence extremely large) and (ii) if X,Y are distinct spaces in F then there never…
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does…
A positive path in the linear symplectic group $\Sp(2n)$ is a smooth path which is everywhere tangent to the positive cone. These paths are generated by negative definite (time-dependent) quadratic Hamiltonian functions on Euclidean space.…
Theories that contain first class constraints possess gauge invariance which results in the necessity of altering the measure in the associated quantum mechanical path integral. If the path integral is derived from the canonical structure…