Related papers: Majority is Stablest : Discrete and SoS
Many statistical estimators are defined as the fixed point of a data-dependent operator, with estimators based on minimizing a cost function being an important special case. The limiting performance of such estimators depends on the…
We study the stability of non-conservative deterministic cross diffusion models and prove that they are approximated by stochastic population models when the populations become locally large. In this model, the individuals of two species…
Stable subgroups and the Morse boundary are two systematic approaches to collect and study the hyperbolic aspects of finitely generated groups. In this paper we unify and generalize these strategies by viewing any geodesic metric space as a…
Two years ago, Conlon and Gowers, and Schacht proved general theorems that allow one to transfer a large class of extremal combinatorial results from the deterministic to the probabilistic setting. Even though the two papers solve the same…
In this paper, we study the long-time stability behavior of a class of linear stochastic evolution equations in a Hilbert space with multiplicative noise. Explicit sufficient conditions for $p$-th moment and almost sure exponential…
Harper's Theorem states that, in a hypercube, among all sets of a given fixed size the Hamming balls have minimal closed neighbourhoods. In this paper we prove a stability-like result for Harper's Theorem: if the closed neighbourhood of a…
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard…
We formulate a stable reduction conjecture that extends Deligne-Mumford's stable reduction to higher dimensions and provide a simple proof that it holds in large characteristic, assuming two standard conjectures of the Minimal Model…
The superiority of stochastic symplectic methods over non-symplectic counterparts has been verified by plenty of numerical experiments, especially in capturing the asymptotic behaviour of the underlying solution process. How can one…
Algorithms for resolving majority cycles in preference aggregation have been studied extensively in computational social choice. Several sophisticated cycle-resolving methods, including Tideman's Ranked Pairs, Schulze's Beat Path, and…
A short proof of a conjecture of Kropholler is given. This gives a relative version of Stallings' Theorem on the structure of groups with more than one end. A generalisation of the Almost Stability Theorem is also obtained, that gives…
Measuring the stability of conclusions derived from Ordinary Least Squares linear regression is critically important, but most metrics either only measure local stability (i.e. against infinitesimal changes in the data), or are only…
This paper proposes a new approach to describe the stability of linear time-invariant systems via the torsion $\tau(t)$ of the state trajectory. For a system $\dot{r}(t)=Ar(t)$ where $A$ is invertible, we show that (1) if there exists a…
Nicaise--Ottem introduced the notion of (stably) rational polytopes and studied this using a combinatorial description of the motivic volume. In this framework, we ask whether being non-stably rational is preserved under inclusions. We…
In the modern Bayesian view classical probability theory is simply an extension of conventional logic, i.e., a quantitative tool that allows for consistent reasoning in the presence of uncertainty. Classical theory presupposes, however,…
We study the stability of quantum pure states and, more generally, subspaces for stochastic dynamics that describe continuously--monitored systems. We show that the target subspace is almost surely invariant if and only if it is invariant…
We present new results for consistency of maximum likelihood estimators with a focus on multivariate mixed models. Our theory builds on the idea of using subsets of the full data to establish consistency of estimators based on the full…
In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…
We introduce a new variational method for the study of stability in the isoperimetric inequality. The method is quite general as it relies on a penalization technique combined with the regularity theory for quasiminimizers of the perimeter.…
We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…