Related papers: Stability Theory for Local Iterated Function Syste…
Recently, bipath persistent homology has been proposed as an extension of standard persistent homology, along with its visualization (bipath persistence diagram) and computational methods. In the setting of standard persistent homology, the…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
We develop a contraction-based framework to establish the existence and exponential stability of periodic solutions in planar nonsmooth dynamical systems governed by Filippov differential inclusions. The method integrates a time- and…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…
Rallis and Soudry have proven the stability under twists by highly ramified characters of the local gamma factor arising from the doubling method, in the case of a symplectic group or orthogonal group G over a local non-archimedean field F…
For a fixed topological Markov shift, we consider measure-preserving dynamical systems of Gibbs measures for 2-locally constant functions on the shift. We also consider isomorphisms between two such systems. We study the set of all…
Collective stable chaos consists of the persistence of disordered patterns in dynamical spatiotemporal systems possessing a negative maximum Lyapunov exponent. We analyze the role of the topology of connectivity on the emergence and…
Classical conditions for asymptotic stability of periodic solutions bifurcating from a limit cycle rely on the derivative of the corresponding bifurcation function F at the bifurcation point t. We show that for analytic systems this result…
Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one mapping of a low-dimensional attractor from the system state…
The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always, i.e., in every round, satisfy non-trivial guarantees, no…
In this article it is proved that the dynamical properties of a broad class of semilinear parabolic problems are sensitive to arbitrarily small but smooth perturbations of the nonlinear term, when the spatial dimension is either equal to…
Stability guarantees are crucial when ensuring a fully autonomous robot does not take undesirable or potentially harmful actions. Unfortunately, global stability guarantees are hard to provide in dynamical systems learned from data,…
In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…
This paper presents reduction theorems for stability, attractivity, and asymptotic stability of compact subsets of the state space of a hybrid dynamical system. Given two closed sets $\Gamma_1 \subset \Gamma_2 \subset \Re^n$, with…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
Symbolic models have recently spurred the interest of the research community because they offer a correct-by-design approach to the control of embedded and cyber-physical systems. In this paper we address construction of symbolic models for…
Exponential family Random Graph Models (ERGMs) can be viewed as expressing a probability distribution on graphs arising from the action of competing social forces that make ties more or less likely, depending on the state of the rest of the…
This paper studies a fundamental relation that exists between stabilizability assumptions usually employed in distributed model predictive control implementations, and the corresponding notions of invariance implicit in such controllers.…
We propose a framework for the connection between local symmetries of discrete Hamiltonians and the design of compact localized states. Such compact localized states are used for the creation of tunable, local symmetry-induced bound states…