Related papers: Persistency of Linear Programming Relaxations for …
As is known, a solitary pulse in the complex cubic Ginzburg-Landau (GL) equation is unstable. We demonstrate that a system of two linearly coupled GL equations with gain and dissipation in one subsystem and pure dissipation in another…
In this paper we discuss the stability properties of convolutional neural networks. Convolutional neural networks are widely used in machine learning. In classification they are mainly used as feature extractors. Ideally, we expect similar…
We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint matrix entries from given interval domains there are…
In deep learning (DL) the instability phenomenon is widespread and well documented, most commonly using the classical measure of stability, the Lipschitz constant. While a small Lipchitz constant is traditionally viewed as guarantying…
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…
We study the linearization stability of the Einstein constraint equations on an asymptotically hyperbolic manifold. In particular we prove that these equations are linearization stable in the neighborhood of vacuum solutions for a…
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable…
Bilevel linear programs (BLPs) form a class of hierarchical decision-making problems in which both the upper-level and the lower-level decision-makers, known as the leader and the follower, respectively, solve linear optimization problems.…
In this study, we provide a detailed analysis of the spike solutions and their stability for theGierer-Meinhardt model on discrete lattices. We explore several phenomena that have no analogues in the continuum limit. For example in the…
We study the nonlinear dynamics of perturbed, spectrally stable $T$-periodic stationary solutions of the Lugiato-Lefever equation (LLE), a damped nonlinear Schr\"odinger equation with forcing that arises in nonlinear optics. It is known…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…
This paper discusses the stabilizability, weak stabilizability, exact observability and robust quadratic stabilizability of linear stochastic control systems. By means of the spectrum technique of the generalized Lyapunov operator, a…
We study the stability of one-dimensional linear lattice Boltzmann schemes for scalar hyperbolic equations with respect to boundary data. Our approach is based on the original raw algorithm on several unknowns, thereby avoiding the need for…
We present an original study on the numerical stabiliy of explicit schemes solving the incompressible Euler equations on an open domain with slipping boundary conditions. Relying on the skewness property of the non-linear term, we…
In this paper, we study the asymptotic stability of smooth 1-solitons in the Degasperis-Procesi (DP) equation. Such solutions necessarily exist on a non-zero background, and their spectral and orbital stability has previously been verified…
We study existence and stability of steady solutions of the isentropic compressible Navier-Stokes equations on a finite interval with non characteristic boundary conditions, for general not necessarily small-amplitude data. We show that…
This paper deals with the maximum independent set (M.I.S.) problem, also known as the stable set problem. The basic mathematical programming model that captures this problem is an Integer Program (I.P.) with zero-one variables $x_j$ and…
The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount…
In this article we study the expanding properties of random perturbations of contracting Lorenz maps satisfying the summability condition of exponent 1. Under general conditions on the maps and perturbation types, we prove stochastic…