相关论文: When can forward stable algorithms be composed sta…
We introduce an efficient stable algorithm for transforms associated with expansions in Hermite functions interpolated at Hermite polynomial roots. The Hermite transform matrix can be factorised into a diagonal component and an orthogonal…
The stability of the Nystr\"om method for the double layer potential equation on simple closed piecewise smooth contours is studied. Necessary and sufficient conditions of the stability of the method are established. It is shown that the…
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…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…
We consider the stability of periodic map with period-$2$ in linear fractional difference equations where the function is $f(x)=ax$ at even times and $f(x)=bx$ at odd times. The stability of such a map for an integer order map depends on…
In pattern-forming systems, localized patterns are states of intermediate complexity between fully extended ordered patterns and completely irregular patterns. They are formed by stationary fronts enclosing an ordered pattern inside an…
We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of…
We prove that a theory $T$ has stable forking if and only if $T^\mathrm{eq}$ has stable forking.
Hypergraphs naturally represent higher-order interactions, which persistently appear from social interactions to neural networks and other natural systems. Although their importance is well recognized, a theoretical framework to describe…
A decision problem is called parameterized if its input is a pair of strings. One of these strings is referred to as a parameter. The problem: given a propositional logic program P and a non-negative integer k, decide whether P has a stable…
We construct stable configurations of n overlapping discs of radius r in a unit square, with r = O(1/n). By a result of Diaconis, Lebeau, and Michel, this result is best possible, up to a constant factor. A consequence is that the…
In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…
Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…
Solutions of bilevel optimization problems tend to suffer from instability under changes to problem data. In the optimistic setting, we construct a lifted formulation that exhibits desirable stability properties under mild assumptions that…
Coalition formation studies how to partition a set of agents into disjoint coalitions under consideration of their preferences. We study the classical objective of stability in a variant of additively separable hedonic games where agents…
In many applications, it is impractical -- if not even impossible -- to obtain data to fit a known cubature formula (CF). Instead, experimental data is often acquired at equidistant or even scattered locations. In this work, stable (in the…
Motivated by a variety of applications, high-dimensional time series have become an active topic of research. In particular, several methods and finite-sample theories for individual stable autoregressive processes with known lag have…
Two types of stability boundaries exist for any planetary system consisting of one star and two planets. Lagrange stability requires that the planets remain bound to the star, conserves the ordering of the distance from the star, and limits…
This paper deals with the asymptotic behavior of solutions to the delayed monostable equation: $(*)$ $u_{t}(t,x) = u_{xx}(t,x) - u(t,x) + g(u(t-h,x)),$ $x \in \mathbb{R},\ t >0,$ where $h>0$ and the reaction term $g: \mathbb{R}_+ \to…
Focusing on the bipartite Stable Marriage problem, we investigate different robustness measures related to stable matchings. We analyze the computational complexity of computing them and analyze their behavior in extensive experiments on…