Related papers: Coarse chain recurrence, Morse graphs with finite …
This paper builds upon the framework of \emph{Morse sequences}, a simple and effective approach to discrete Morse theory. A Morse sequence on a simplicial complex consists of a sequence of nested subcomplexes generated by expansions and…
We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking…
We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence together with a depth first exploration of it. In the so-called supercritical regime where the graph contains a giant component, we prove that…
We already know a great deal about dynamical systems with uniqueness in forward time. Indeed, flows, semiflows, and maps (both invertible and not) have been studied at length. A view that has proven particularly fruitful is topological:…
This paper brings together three distinct theories with the goal of quantifying shape textures with complex morphologies. Distance fields are central objects in shape representation, while topological data analysis uses algebraic topology…
We propose in the paper a novel framework for using a common control input to simultaneously steer an infinite ensemble of networked control systems. We address the problem of co-designing information flow topology and network dynamics of…
Arrhythmias are potentially fatal disruptions to the normal heart rhythm, but their underlying dynamics is still poorly understood. Theoretical modeling is an important tool to fill this gap. Typical studies often employ detailed…
Networked nonlinear systems present a variety of emergent phenomena as a result of the mutual interactions between their units. An interesting feature of these systems is the presence of stable periodic behavior even when each unit…
A variety of nonlinear models of biological systems generate complex chaotic behaviors that contrast with biological homeostasis, the observation that many biological systems prove remarkably robust in the face of changing external or…
We introduce a framework for network analysis based on random walks on directed acyclic graphs where the probability of passing through a given node is the key ingredient. We illustrate its use in evaluating the mutual influence of nodes…
We develop a practical approach to establish the stability, that is, the recurrence in a given set, of a large class of controlled Markov chains. These processes arise in various areas of applied science and encompass important numerical…
We introduce a parameter sharing scheme, in which different layers of a convolutional neural network (CNN) are defined by a learned linear combination of parameter tensors from a global bank of templates. Restricting the number of templates…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
Single-file transport refers to the motion of particles in a narrow channel, such that they cannot bypass each other. This constraint leads to strong correlations between the particles, described by correlation profiles, which measure the…
The pattern dynamics of the one-way coupled logistic lattice which can serve as a phenomenological model for open flow is investigated and shown to be extremely rich. For medium and large coupling strengths, we find spatially periodic,…
Graph convolutional neural networks (GCNNs) have emerged as powerful tools for analyzing graph-structured data, achieving remarkable success across diverse applications. However, the theoretical understanding of the stability of these…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
This paper addresses questions regarding controllability for `generic parameter' dynamical systems, i.e. the question whether a dynamical system is `structurally controllable'. Unlike conventional methods that deal with structural…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
We rely on the framework of Morse sequences to enable the direct computation of gradient vector fields on simplicial complexes. A Morse sequence is a filtration from a subcomplex $L$ to a complex $K$ via elementary expansions and fillings,…