Related papers: Reparametrizations of Continuous Paths
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…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
In this work, we define the notion of unimodular random measured metric spaces as a common generalization of various other notions. This includes the discrete cases like unimodular graphs and stationary point processes, as well as the…
We demonstrate the reparametrization invariance of perturbatively defined one-dimensional functional integrals up to the three-loop level for a path integral of a quantum-mechanical point particle in a box. We exhibit the origin of the…
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
The critical behavior for intermittency is studied in two coupled one-dimensional (1D) maps. We find two fixed maps of an approximate renormalization operator in the space of coupled maps. Each fixed map has a common relavant eigenvaule…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space $X$ which are obtained by deleting singletons determine $X$…
When planning motions in a configuration space that has underlying symmetries (e.g. when manipulating one or multiple symmetric objects), the ideal planning algorithm should take advantage of those symmetries to produce shorter…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
We study a class of chainable continua which contains, among others, all inverse limit spaces generated by a single interval bonding map which is piecewise monotone and locally eventually onto. Such spaces are realized as attractors of…
This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the…
A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form of noisy filamentary structures, such as…
Persistent homology has been widely used to discover hidden topological structures in data across various applications, including music data. To apply persistent homology, a distance or metric must be defined between points in a point cloud…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…