Related papers: Contractibility of a persistence map preimage
For a transitive countably piecewise monotone Markov interval map we consider the question whether there exists a conjugate map of constant slope. The answer varies depending on whether the map is continuous or only piecewise continuous,…
This paper analyzes the stability of interconnected continuous-time (CT) and discrete-time (DT) systems coupled through sampling and zero-order hold mechanisms. The DT system updates its output at regular intervals $T>0$ by applying an…
The topological morphology descriptor of a neuron is a multiset of intervals associated to the shape of the neuron represented as a tree. In practice, topological morphology descriptors are vectorized using persistence images, which can…
We use Topological Data Analysis tools for studying the inner organization of cells in segmented images of epithelial tissues. More specifically, for each segmented image, we compute different persistence barcodes, which codify lifetime of…
In this study, we introduce novel methodologies designed to adapt original data in response to the dynamics of persistence diagrams along Wasserstein gradient flows. Our research focuses on the development of algorithms that translate…
Randomly-assembled dynamical systems are theoretically predicted to be unstable upon crossing a critical threshold of complexity, as first shown by May. Yet, empirical complex systems exhibit remarkable stability, indicating the presence of…
We study a generic family of nonlinear dynamics on undirected networks generalising linear consensus. We find a compact expression for its equilibrium points in terms of the topology of the network and classify their stability using the…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
Persistent homology is a popular data analysis technique that is used to capture the changing topology of a filtration associated with some simplicial complex $K$. These topological changes are summarized in persistence diagrams. We propose…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…
We derive conditions for the existence of fixed points of cone mappings without assuming scalability of functions. Monotonicity and scalability are often inseparable in the literature in the context of searching for fixed points of…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…
Category theory has been recently used as a tool for constructing and modeling an information flow framework. Here, we show that the flow of information can be described using preradicals. We prove that preradicals generalize the notion of…
An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In…
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…