Related papers: Higher-order generalizations of stability and arit…
In this paper, we introduce a notion of algorithmic stability called typical stability. When our goal is to release real-valued queries (statistics) computed over a dataset, this notion does not require the queries to be of bounded…
We study stability of metric approximations of countable groups with respect to groups endowed with ultrametrics, the main case study being a $p$-adic analogue of Ulam stability, where we take $GL_n(\mathbb{Z}_p)$ as approximating groups…
We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
We characterize which quadratic regular algebras of global dimension 3 are stable in the sense of Behrend-Noohi. (This notion of stability is a non-commutative analogue of Hilbert stability.) We describe the quasi-projective stack of stable…
Estimation of structure, such as in variable selection, graphical modelling or cluster analysis is notoriously difficult, especially for high-dimensional data. We introduce stability selection. It is based on subsampling in combination with…
We prove geometric and cohomological stabilization results for the universal smooth degree $d$ hypersurface section of a fixed smooth projective variety as $d$ goes to infinity. We show that relative configuration spaces of the universal…
This paper consists of two related parts. In the first part we give a self-contained proof of homological stability for the spaces C_n(M;X) of configurations of n unordered points in a connected open manifold M with labels in a…
We introduce the idea of *representation stability* (and several variations) for a sequence of representations V_n of groups G_n. A central application of the new viewpoint we introduce here is the importation of representation theory into…
Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that the sumset $NA$ has predictable size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in some finite cone other than all…
Exponential generalization bounds with near-tight rates have recently been established for uniformly stable learning algorithms. The notion of uniform stability, however, is stringent in the sense that it is invariant to the data-generating…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
In the context of holomorphic families of ${\mathbb P}^k$ endomorphisms, we show that various notions of stability are equivalent. This allows us to both extend and simplify the architecture of the proof of certain results of [BBD]
Recently, the stability of certain topological phases of matter under weak perturbations was proven. Here, we present a short, alternate proof of the same result. We consider models of topological quantum order for which the unperturbed…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi. In this paper we set out a…
We show that a large family of groups is uniformly stable relative to unitary groups equipped with submultiplicative norms, such as the operator, Frobenius, and Schatten $p$-norms. These include lamplighters $\Gamma \wr \Lambda$ where…
We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…
In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…