Related papers: Path-Complete Graphs and Common Lyapunov Functions
We explicitly construct global strict Lyapunov functions for rapidly time-varying nonlinear control systems. The Lyapunov functions we construct are expressed in terms of oftentimes more readily available Lyapunov functions for the limiting…
Analysis of continuous-time piecewise linear systems based on piecewise quadratic (PWQ) Lyapunov functions typically requires continuity of these functions over a partition of the state space. Several conditions for guaranteeing continuity…
We propose a composite Lyapunov framework for nonlinear autonomous systems that ensures strict decay through a pair of differential inequalities. The approach yields integral estimates, quantitative convergence rates, vanishing of…
We present a computational framework for synthesizing a single smooth Lyapunov function that certifies both asymptotic stability and safety. We show that the existence of a strictly compatible pair of control barrier and control Lyapunov…
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…
This article proposes an approach to construct a Lyapunov function for a linear coupled impulsive system consisting of two time-invariant subsystems. In contrast to various variants of small-gain stability conditions for coupled systems,…
The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most reliable graphs…
Lyapunov functions are used to prove stability of equilibria, or to indicate a gradient-like structure of a dynamical system. Zelenyak (1968) and Matano (1988) constructed a Lyapunov function for quasilinear parabolic equations. We modify…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
We show that every globally asymptotically stable system with a twice continuously differentiable vector field admits a local polynomial Lyapunov function on an arbitrary bounded neighborhood of the origin.
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…
A leaf matching operation on a graph consists of removing a vertex of degree~$1$ together with its neighbour from the graph. For $k\geq 0$, let $G$ be a $d$-regular cyclically $(d-1+2k)$-edge-connected graph of even order. We prove that for…
We use Lyapunov type functions to give new conditions under which a homeomorphism of a compact metric space has the shadowing property. These conditions are applied to establish the topological stability of some homeomorphisms with…
A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.
It is well know that for globally contractive autonomous systems, there exists a unique equilibrium and the distance to the equilibrium evaluated along any trajectory decreases exponentially with time. We show that, additionally, the…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…
We introduce a class of linear compartmental models called identifiable path/cycle models which have the property that all of the monomial functions of parameters associated to the directed cycles and paths from input compartments to output…
The paper is devoted to the development of control procedures with a guide for conflict-controlled dynamical systems described by ordinary fractional differential equations with the Caputo derivative of an order $\alpha \in (0, 1).$ For the…
In this paper, we develop Pesin theory for the boundary map of some Fatou components of transcendental functions, under certain hyptothesis on the singular values and the Lyapunov exponent. That is, we prove that generic inverse branches…