Related papers: Geodesic stability for memoryless binary long-live…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…
We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the control of a message adversary. In contrast to a large body…
We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of…
Robustness in terms of outliers is an important topic and has been formally studied for a variety of problems in machine learning and computer vision. Generalized median computation is a special instance of consensus learning and a common…
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 answer two questions raised by Bryant, Francis and Steel in their work on consensus methods in phylogenetics. Consensus methods apply to every practical instance where it is desired to aggregate a set of given phylogenetic trees (say,…
We reconsider both the global and local stability of solutions of continuously evolving dynamical systems from a geometric perspective. We clarify that an unambiguous definition of stability generally requires the choice of additional…
We are concerned with the problem of determining the nonlinear term in a semilinear elliptic equation by boundary measurements. Precisely, we improve [5, Theorem 1.3], where a logarithmic type stability estimate was proved. We show actually…
The notion of linear stability of a variety in projective space was introduced by Mumford in the context of GIT. It has subsequently been applied by Mistretta and others to Butler's conjecture on stability of the dual span bundle (DSB)…
We find an upper bound for geodesic distances associated to monotone Riemannian metrics on positive definite matrices and density matrices.
In this paper, we are interested in investigating notions of stability for generalized linear differential equations (GLDEs). Initially, we propose and revisit several definitions of stability and provide a complete characterisation of them…
The linear stability of closed timelike geodesics (CTGs) is analyzed in two spacetimes with cylindrical sources, an infinite rotating dust cylinder, and a cylindrical cloud of static cosmic strings with a central spinning string. We also…
This paper investigates the robustness of exponential stability of a class of switched systems described by linear functional differential equations under arbitrary switching. We will measure the stability robustness of such a system,…
In this paper, the stability condition for low-density parity-check (LDPC) codes on the binary erasure channel (BEC) is extended to generalized LDPC (GLDPC) codes and doublygeneralized LDPC (D-GLDPC) codes. It is proved that, in both cases,…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
Let $g$ be a Riemannian metric for $\mathbf{R}^d$ ($d\geq 3$) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain $M$. The lens rigidity problem is concerned with recovering the metric $g$ inside $M$…
A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.
Can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories? We tackle this black-box problem for switched linear systems. We show that, for any given random set of…