Related papers: Path-Complete Graphs and Common Lyapunov Functions
Lyapunov functions play a fundamental role in analyzing the stability and convergence properties of optimization methods. In this paper, we propose a novel and straightforward approach for constructing Lyapunov functions for first-order…
Stability margins for linear time-varying (LTV) and switched-linear systems are traditionally computed via quadratic Lyapunov functions, and these functions certify the stability of the system under study. In this work, we show how the more…
We have recently constructed a piecewise quadratic Lyapunov function to prove the boundedness of the reachable values set of piecewise affine discrete-time systems. The method developed also provided an overapproximation of the reachable…
In the design and operation of complex dynamical systems, it is essential to ensure that all state trajectories of the dynamical system converge to a desired equilibrium within a guaranteed stability region. Yet, for many practical systems…
This work proposes a novel distributed framework for verifying the incremental stability of large-scale systems with unknown dynamics and known interconnection structures using graph neural networks. Our proposed approach relies on the…
This paper presents a synthesis approach aiming to guarantee a minimum upper-bound for the time taken to reach a target set of non-zero measure that encompasses the origin, while taking into account uncertainties and input and state…
We show that a linear Young differential equation generates a topological two-parameter flow, thus the notions of Lyapunov exponents and Lyapunov spectrum are well-defined. The spectrum can be computed using the discretized flow and is…
Leavitt path algebras L of an arbitrary graph E over a field K satisfying a polynomial identity are completely characterized both in graph-theoretic and algebraic terms. When E is a finite graph, L satisfying a polynomial identity is shown…
In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…
We show that the robust forward completeness for distributed parameter systems is equivalent to the existence of a corresponding Lyapunov function that increases at most exponentially along the trajectories.
The aim of this paper is to study in detail the relations between strong chain recurrence for flows and Lyapunov functions. For a continuous flow on a compact metric space, uniformly Lipschitz continuous on the compact subsets of the time,…
This paper presents converse theorems for safety in terms of barrier functions for unconstrained continuous-time systems modeled as differential inclusions. Via a counterexample, we show the lack of existence of autonomous and continuous…
The dependence of the Lyapunov exponent on the closeness parameter, $\epsilon$, in tangent bifurcation systems is investigated. We study and illustrate two averaging procedures for defining Lyapunov exponents in such systems. First, we…
Lyapunov's second or direct method is one of the most widely used techniques for investigating stability properties of dynamical systems. This technique makes use of an auxiliary function, called a Lyapunov function, to ascertain stability…
This paper presents some new propositions related to the fractional order $h$-difference operators, for the case of general quadratic forms and for the polynomial type, which allow proving the stability of fractional order $h$-difference…
We apply a Lyapunov function to obtain conditions for the existence and uniqueness of small classical time-periodic solutions to first order quasilinear 1D hyperbolic systems with (nonlinear) nonlocal boundary conditions in a strip. The…
We consider nonautonomous cyclic systems of delay differential equations with variable delay. Under suitable feedback assumptions, we define an (integer valued) Lyapunov functional related to the number of sign changes of the coordinate…
Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, $\tau$. Paths are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasingly…
Fixed-time stable dynamical systems are capable of achieving exact convergence to an equilibrium point within a fixed time that is independent of the initial conditions of the system. This property makes them highly appealing for designing…