Related papers: Stability Theorems for Forbidden Configurations
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…
This paper presents stability and accuracy analysis of a high-order explicit time stepping scheme introduced by \cite[Section 2.2]{Buvoli2019}, which exhibits superior stability compared to classical Adams-Bashforth. A conjecture that is…
We consider the problem of computing the closest stable/unstable non-negative matrix to a given real matrix. This problem is important in the study of linear dynamical systems, numerical methods, etc. The distance between matrices is…
A first-order structure $\mathfrak{A}$ is called monadically stable iff every expansion of $\mathfrak{A}$ by unary predicates is stable. In this article we give a classification of the class $\mathcal{M}$ of $\omega$-categorical monadically…
For $M$ $\omega$-categorical and stable, we investigate the growth rate of $M$, i.e. the number of orbits of $Aut(M)$ on $n$-sets, or equivalently the number of $n$-substructures of $M$ after performing quantifier elimination. We show that…
The present article considers stability of the solutions to nonlinear and nonautonomous compartmental systems governed by ordinary differential equations (ODEs). In particular, compartmental systems with a right-hand side that can be…
The growth of multicomponent structures in simulations and experiments often results in kinetically trapped, nonequilibrium objects. In such cases we have no general theoretical framework for predicting the outcome of the growth process.…
Contraction theory is an analytical tool to study differential dynamics of a non-autonomous (i.e., time-varying) nonlinear system under a contraction metric defined with a uniformly positive definite matrix, the existence of which results…
We consider the autonomous dynamical system $x' = Ax$, with $A \in \mathbb{R}^{n\times n}$. This linear dynamical system is said to be asymptotically stable if all of the eigenvalues of A lie in the open left-half of the complex plane. In…
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
We consider the existence and stability of static configurations of a scalar field in a five dimensional spacetime in which the extra spatial dimension is compactified on an $S^1/Z_2$ orbifold. For a wide class of potentials with multiple…
Fractional difference equations provide a flexible mathematical framework for modeling complex systems with memory, hereditary, and non-local effects. In this work, we study the stability of higher-order two-term fractional linear…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
The leading-order approximation to a Filippov system $f$ about a generic boundary equilibrium $x^*$ is a system $F$ that is affine one side of the boundary and constant on the other side. We prove $x^*$ is exponentially stable for $f$ if…
We introduce two related notions of pattern enforcement in $(0,1)$-matrices: $Q$-forcing and strongly $Q$-forcing, which formalize distinct ways a fixed pattern $Q$ must appear within a larger matrix. A matrix is $Q$-forcing if every…
A family $F$ of sets is said to be $t$-intersecting if $|A \cap B| \geq t$ for any $A,B \in F$. The seminal Complete Intersection Theorem of Ahlswede and Khachatrian (1997) gives the maximal size $f(n,k,t)$ of a $t$-intersecting family of…
We propose matrix commutator based stability characterization for discrete-time switched linear systems under restricted switching. Given an admissible minimum dwell time, we identify sufficient conditions on subsystems such that a switched…
There has been a long-standing and at times fractious debate whether complex and large systems can be stable. In ecology, the so-called `diversity-stability debate' arose because mathematical analyses of ecosystem stability were either…