Related papers: Persistency of Linear Programming Relaxations for …
We prove that small nonlinear perturbations of random linear dynamics admitting a tempered exponential dichotomy have a random version of the shadowing property. As a consequence, if the exponential dichotomy is uniform, we get that the…
We study the stability properties of linear time-varying systems in continuous time whose system matrix is Metzler with zero row sums. This class of systems arises naturally in the context of distributed decision problems, coordination and…
In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of…
We review the stability properties of several discretizations of the Helmholtz equation at large wavenumbers. For a model problem in a polygon, a complete $k$-explicit stability (including $k$-explicit stability of the continuous problem)…
We study solutions to a one-phase singular perturbation problem that arises in combustion theory and that formally approximates the classical one-phase free boundary problem. We introduce a natural density condition on the transition layers…
This paper introduces a novel approach to evaluating the asymptotic stability of equilibrium points in both continuous-time (CT) and discrete-time (DT) nonlinear autonomous systems. By utilizing indirect Lyapunov methods and linearizing…
We establish a logarithmic stability inequality for the inverse problem of determining the non linear term, appearing in a semilinear BVP, from the corresponding Dirichlet-to-Neumann map (abbreviated to DtN map in the rest of this text).…
One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…
Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to…
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
We show that a positive linear map preserves local continuity (convergence) of the entropy if and only if it preserves finiteness of the entropy, i.e. transforms operators with finite entropy to operators with finite entropy. The last…
Recently, a stability theory has been developed to study the linear stability of modified Patankar--Runge--Kutta (MPRK) schemes. This stability theory provides sufficient conditions for a fixed point of an MPRK scheme to be stable as well…
We consider the Kelvin-Helmholtz system describing the evolution of a vortex-sheet near the circular stationary solution. Answering previous numerical conjectures in the 90s physics literature, we prove an almost global existence result for…
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…
We formulate and study the infinite dimensional linear programming (LP) problem associated with the deterministic discrete time long-run average criterion optimal control problem. Along with its dual, this LP problem allows one to…
The Camassa-Holm equation with linear dispersion was originally derived as an asymptotic equation in shallow water wave theory. Among its many interesting mathematical properties, which include complete integrability, perhaps the most…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We examine the stability of loss-minimizing training processes that are used for deep neural networks (DNN) and other classifiers. While a classifier is optimized during training through a so-called loss function, the performance of…
The stability of topological persistence is one of the fundamental issues in topological data analysis. Numerous methods have been proposed to address the stability of persistent modules or persistence diagrams. Recently, the concept of…