Related papers: Path-Complete Graphs and Common Lyapunov Functions
Lyapunov functions provide a tool to analyze the stability of nonlinear systems without extensively solving the dynamics. Recent advances in sum-of-squares methods have enabled the algorithmic computation of Lyapunov functions for…
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…
We investigate the formal synthesis of global polynomial Lyapunov functions for polynomial vector fields. We establish that a sign-definite polynomial must satisfy specific algebraic constraints, which we leverage to develop a set of…
In this paper, we study the multifractal analysis for Markov-R\'{e}nyi maps, which form a canonical class of piecewise differentiable interval maps, with countably many branches and may contain a parabolic fixed point simultaneously, and do…
The robustness of the universality class concept of the chaotic transition was investigated by analytically obtaining its critical exponent for a wide class of maps. In particular, we extended the existing one-dimensional chaotic maps,…
We prove that for every discrete-time linear switching system in two complex variables and with finitely many switching states, either the system is Lyapunov stable or there exists a trajectory which escapes to infinity with at least linear…
A particularly simple model belonging to a wide class of coupled maps which obey a local conservation law is studied. The phase structure of the system and the types of the phase transitions are determined. It is argued that the structure…
In this paper, we discuss the Lyapunov exponent definition of chaos and how it can be used to quantify the chaotic behavior of a system. We derive a way to practically calculate the Lyapunov exponent of a one-dimensional system and use it…
We investigate the behavior of the Lyapunov spectrum of a linear discrete-time system under the action of small perturbations in order to obtain some verifiable conditions for stability and openness of the Lyapunov spectrum. To this end we…
We provide explicit closed form expressions for strict Lyapunov functions for time-varying discrete time systems. Our Lyapunov functions are expressed in terms of known nonstrict Lyapunov functions for the dynamics and finite sums of…
In this paper, a class of abstract dynamical systems is considered which encompasses a wide range of nonlinear finite- and infinite-dimensional systems. We show that the existence of a non-coercive Lyapunov function without any further…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
A family of non-conjugate chaotic maps generalizing the well-known logistic function is defined, and some of its basic properties studied. A simple formula for the Lyapunov exponents of all the maps contained in this family is given based…
A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
This paper studies finite-time stability of a class of hybrid systems. We present sufficient conditions in terms of multiple generalized Lyapunov functions for the origin of the hybrid system to be finite-time stable. More specifically, we…
We investigate chaos in mixed-phase-space Hamiltonian systems using time series of the finite- time Lyapunov exponents. The methodology we propose uses the number of Lyapunov exponents close to zero to define regimes of ordered…
An algorithm to characterize collective motion is presented, with the introduction of ``collective Lyapunov exponent'', as the orbital instability at a macroscopic level. By applying the algorithm to a globally coupled map, existence of…
A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to…
In this paper we use a path-integral approach to represent the Lyapunov exponents of both deterministic and stochastic dynamical systems. In both cases the relevant correlation functions are obtained from a (one-dimensional) supersymmetric…