Related papers: Non-uniformly Stable Common Independent Sets
A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical applications, ranging from…
This brief gives a set of unified Lyapunov stability conditions to guarantee the predefined-time/finite-time stability of a dynamical systems. The derived Lyapunov theorem for autonomous systems establishes equivalence with existing…
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…
This paper is concerned with the stability analysis of continuous-time switched systems with a random switching signal. The switching signal manifests its characteristics with that the dwell time in each subsystem consists of a fixed part…
We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…
This paper presents a new paradigm to stabilize uncertain stochastic linear systems. Herein, second moment polytopic (SMP) systems are proposed that generalize systems with both uncertainty and randomness. The SMP systems are characterized…
Consider the stable matching problem on two sets. We introduce the concept of a preference cycle and show how its natural presence in stable matchings proves a series of classical results in an elementary way.
The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of…
We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges and they also have the right to…
Numerical simulations of coupled map lattices (CMLs) and other complex model systems show an enormous phenomenological variety that is difficult to classify and understand. It is therefore desirable to establish analytical tools for…
In this paper we introduce the concept of universal stabilizability: the condition that every solution of a nonlinear system can be globally stabilized. We give sufficient conditions in terms of the existence of a control contraction…
In theories with unstable particles, unitarity is satisfied by the inclusion of only stable states in unitarity sums. Hence unitarity cuts are not to be taken through unstable particles. This raises a challenge to the generalized unitarity…
We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…
Linear systems governed by continuous-time difference equations cover a wide class of linear systems. From the Lyapunov-Krasovskii approach, we investigate stability for such a class of systems. Sufficient conditions, and in some particular…
We consider a nonlinear non-autonomous system with time-varying delays $$ \dot{x_i}(t)=-a_i(t)x_{i}(h_i(t))+\sum_{j=1}^mF_{ij}(t,x_j(g_{ij}(t))) $$ which has a large number of applications in the theory of artificial neural networks. Via…
We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the…
For Kolmogorov test we find natural conditions of uniform consistency of sets of alternatives approaching to hypothesis. Sets of alternatives can be defined both in terms of distribution functions and in terms of densities.