Related papers: Spectral gap and stability for groups and non-loca…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
We study $\epsilon$-representations of discrete groups by unitary operators on a Hilbert space. We define the notion of Ulam stability of a group which loosely means that finite-dimensional $\epsilon$-represendations are uniformly close to…
We carry out a stability analysis for the real space split operator method for the propagation of the time-dependent Klein-Gordon equation that has been proposed Ruf et al. [M. Ruf, H. Bauke, C.H. Keitel, A real space split operator method…
We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…
This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…
We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…
Capacitated network bargaining games are popular combinatorial games that involve the structure of matchings in graphs. We show that it is always possible to stabilize unit-weight instances of this problem (that is, ensure that they admit a…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
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…
A group may be considered $C^*$-stable if almost representations of the group in a $C^*$-algebra are always close to actual representations. We initiate a systematic study of which discrete groups are $C^*$-stable or only stable with…
In the framework of instantaneous approximations to the Bethe-Salpeter formalism for the description of bound states within quantum field theories, depending on the Lorentz structure of the Bethe-Salpeter interaction kernel the solutions of…
In a stable matching problem there are two groups of agents, with agents on one side having their individual preferences for agents on another side as a potential match. It is assumed silently that agents can freely and costlessly ``switch"…
Motivated by the fact that in many game-theoretic settings, the game analyzed is only an approximation to the game being played, in this work we analyze equilibrium computation for the broad and natural class of bimatrix games that are…
Subgroup stability is a strong notion of quasiconvexity that generalizes convex cocompactness in a variety of settings. In this paper, we characterize stability of a subgroup by properties of its limit set on the Morse boundary. Given…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
We consider solutions satisfying the Neumann zero boundary condition and a linearized mean field game system in $\Omega \times (0,T)$, where $\Omega$ is a bounded domain in $\mathbb{R}^d$ and $(0,T)$ is the time interval. We prove two kinds…
Simple-minded systems in stable module categories are defined by orthogonality and generating properties so that the images of the simple modules under a stable equivalence form such a system. Simple-minded systems are shown to be invariant…
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…
The Swift-Hohenberg equation describes an instability which forms finite-wavenumber patterns near onset. We study this equation posed with a spatial inhomogeneity; a jump-type parameter that renders the zero solution stable for $x<0$ and…
We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…