Related papers: Stability of higher-dimensional interval decomposa…
For interval polynomial matrices, we identify the minimal testing set, whose stability can guarantee that of the whole uncertain set. Our results improve the conclusions given by Kamal and Dahleh.
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
One-dimensional persistent homology is arguably the most important and heavily used computational tool in topological data analysis. Additional information can be extracted from datasets by studying multi-dimensional persistence modules and…
We investigate the Euclidean $d$-Dimensional Stable Roommates problem, which asks whether a given set~$V$ of $d \cdot n$ points from the 2-dimensional Euclidean space can be partitioned into $n$ disjoint (unordered) subsets…
We characterise subcategories of semistable modules for noncommutative minimal models of compound Du Val singularities, including the non-isolated case. We find that the stability is controlled by an infinite polyhedral fan that stems from…
Many modern datasets don't fit neatly into $n \times p$ matrices, but most techniques for measuring statistical stability expect rectangular data. We study methods for stability assessment on non-rectangular data, using statistical learning…
The stability of an Auto-Regressive (AR) time sequence of finite order $L$, is determined by the maximal modulus $r^\star$ among all zeros of its generating polynomial. If $r^\star<1$ then the effect of input and initial conditions decays…
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove…
We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…
In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…
In this paper, we introduce fundamental notions of homotopy theory, including homotopy excision and the Freudenthal suspension theorem. We then explore framed cobordism and its connection to stable homotopy groups of spheres through the…
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…
We prove that pointwise finite-dimensional S^1 persistence modules over an arbitrary field decompose uniquely, up to isomorphism, into the direct sum of a bar code and finitely-many Jordan cells. These persistence modules have also been…
We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…
The linear stability of buoyant parallel flow in a vertical porous layer with an annular cross-section is investigated. The vertical cylindrical boundaries are kept at different uniform temperatures and they are assumed to be impermeable.…
We prove homological stability for both general linear groups of modules over a ring with finite stable rank and unitary groups of quadratic modules over a ring with finite unitary stable rank. In particular, we do not assume the modules…
We study the asymptotic stability of a dissipative evolution in a Hilbert space subject to intermittent damping. We observe that, even if the intermittence satisfies a persistent excitation condition, if the Hilbert space is…
Stability, akin to reproducibility, is crucial in statistical analysis. This paper examines the stability of sparse network inference in high-dimensional graphical models, where selected edges should remain consistent across different…
A solution to a given equation is structurally stable if it suffers only an infinitesimal change when the equation (not the solution) is perturbed infinitesimally. We have found that structural stability can be used as a velocity selection…
For perturbations of integrable Hamiltonians systems, the Nekhoroshev theorem shows that all solutions are stable for an exponentially long interval of time, provided the integrable part satisfies a steepness condition and the system is…