Related papers: Skorokhod's topologies on path space
The Bohr compactification is a well known construction for (topological) groups and semigroups. Recently, this notion has been investigated for arbitrary structures in \cite{har_kun:bohr_discrete} where the Bohr compactification is defined,…
Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…
A common approach for describing classes of functions and probability measures on a topological space $\mathcal{X}$ is to construct a suitable map $\Phi$ from $\mathcal{X}$ into a vector space, where linear methods can be applied to address…
Directed paths have been used by several authors to describe concurrent executions of a program. Spaces of directed paths in an appropriate state space contain executions with all possible legal schedulings. It is interesting to investigate…
A Cech closure space $(X,u)$ is a set $X$ with a (Cech) closure operator $u$ which need not be idempotent. Many properties which hold in topological spaces hold in Cech closure spaces as well. The notions of proper (splitting) and…
Lov\'{a}sz and Cherkassky discovered independently that, if $G$ is a finite graph and $T\subseteq V(G)$ such that the degree $d_G(v)$ is even for every vertex $v\in V(G)\setminus T$, then the maximum number of edge-disjoint paths which are…
We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…
We generalize some classical results about quasicontinuous and separately continuous functions with values in metrizable spaces to functions with values in certain generalized metric spaces, called Maslyuchenko spaces. We establish…
We prove that some paths of contactomorphisms of $\mathbb{R}^{2n} \times S^1$ endowed with its standard contact structure are geodesics for different norms defined on the identity component of the group of compactly supported…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
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 path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence…
In chaotic deterministic systems, seemingly stochastic behavior is generated by relatively simple, though hidden, organizing rules and structures. Prominent among the tools used to characterize this complexity in 1D and 2D systems are…
If we consider a sequence of warped product length spaces, what conditions on the sequence of warping functions implies compactness of the sequence of distance functions? In particular, we want to know when a subsequence converges to a well…
We present a set of principles and methodologies which may serve as foundations of a unifying theory of Mathematics. These principles are based on a new view of Grothendieck toposes as unifying spaces being able to act as `bridges' for…
Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at…
We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…