Related papers: Majority is Stablest : Discrete and SoS
Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, \textit{i.e.} the states whose weights in the stationary distributions can be bounded away from $0$ as…
The dominated convergence theorem implies that if (f_n) is a sequence of functions on a probability space taking values in the interval [0,1], and (f_n) converges pointwise a.e., then the sequence of integrals converges to the integral of…
A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…
We investigate the incremental stability properties of It\^o stochastic dynamical systems. Specifically, we derive a stochastic version of nonlinear contraction theory that provides a bound on the mean square distance between any two…
We establich quantitative stability estimates for the Trudinger-Moser inequality on smooth, bounded domains in the Euclidean plane. More specifically, we prove that the deficit in the Trudinger-Moser inequality quadratically controls the…
We define a new class of sets -- stable sets -- of primes in number fields. For example, Chebotarev sets $P_{M/K}(\sigma)$, with $M/K$ Galois and $\sigma \in \Gal(M/K)$, are very often stable. These sets have positive (but arbitrary small)…
We investigate entropy minimization problems for quantum states subject to convex block-separable constraints. Our principal result is a quantitative stability theorem: under a natural confining (fixed-support) hypothesis, if a state has…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
This study investigated the stability of Hamilton--Jacobi equation on general metric spaces with a perturbation in some whole space. This type of stability appears in the domain perturbation problem. We find that the stability holds when…
The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…
Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. In…
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…
This paper develops a new approach to the estimation of the degree of boundedness or stability of multidimensional nonlinear systems with time-dependent nonperiodic coefficients-an essential task in various engineering and natural science…
Algorithmic stability is a central concept in statistics and learning theory that measures how sensitive an algorithm's output is to small changes in the training data. Stability plays a crucial role in understanding generalization,…
We prove a sharp quantitative version for the stability of the Sobolev inequality with explicit constants. Moreover, the constants have the correct behavior in the limit of large dimensions, which allows us to deduce an optimal quantitative…
We study equilibrium selection for invariant measures of stochastic dynamical systems with constant step size, under persistent noise and minimal moment assumptions, in a general quasi-Feller framework. Such dynamics arise in…
We prove stochastic stability of chaotic maps for a general class of Markov random perturbations (including singular ones) satisfying some kind of mixing conditions. One of the consequences of this statement is the proof of Ulam's…
A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response to gaps in existing learning models, we introduce a new…
We define the empiric stochastic stability of an invariant measure in the finite-time scenario, the classical definition of stochastic stability. We prove that an invariant measure of a continuous system is empirically stochastically stable…