Related papers: Reparametrizations of Continuous Paths

Let $K$ be an arbitrary semi-cubical set that can be embedded in a standard cube. Using Discrete Morse Theory, we construct a CW-complex that is homotopy equivalent to the space $\vec{P}(K)_v^w$ of directed paths between two given vertices…

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

In this paper we develop a technique of constructing uni- formly continuous maps between function spaces Cp(X) endowed with the pointwise topology. We prove that if a space X is compact metrizable and strongly countable-dimensional, then…

We obtain direct, finite, descriptions of a renormalized quantum mechanical system with no reference to ultraviolet cutoffs and running coupling constants, in both the Hamiltonian and path integral pictures. The path integral description…

The standard way to parameterize the distributions represented by a directed acyclic graph is to insert a parametric family for the conditional distribution of each random variable given its parents. We show that when one's goal is to test…

Let $P_n$ denote the undirected path of length $n-1$. The cardinality of the set of congruence classes induced by the graph homomorphisms from $P_n$ onto $P_k$ is determined. This settles an open problem of Michels and Knauer (Disc. Math.,…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…

We propose a novel method for motion planning and illustrate its implementation on several canonical examples. The core novel idea underlying the method is to define a metric for which a path of minimal length is an admissible path, that is…

Using a renormalization method, we study the critical behavior for intermittency in two coupled one-dimensional (1D) maps. We find two fixed maps of the renormalization transformation. They all have common relevant eigenvalues associated…

This work presents a new path classification criterion to distinguish paths geometrically and topologically from the workspace, which is divided through cell decomposition, generating a medial-axis-like skeleton structure. We use this…

We consider the problem of reconstructing the paths of a set of points over time, where, at each of a finite set of moments in time the current positions of points in space are only accessible through some small number of their X-rays. This…

We define the notions of unilateral metric derivatives and ``metric derived numbers'' in analogy with Dini derivatives (also referred to as ``derived numbers'') and establish their basic properties. We also prove that the set of points…

We provide a representation of the homomorphisms $U\longrightarrow \mathbb R$, where $U$ is the lattice of all uniformly continuous on the line. The resulting picture is sharp enough to describe the fine topological structure of the space…

Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which…

First, we generalize the definition of a locally compact topology given by Paterson and Welch for a sequence of locally compact spaces to the case where the underlying spaces are $T_1$ and sober. We then consider a certain semilattice of…

Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…