相关论文: When can forward stable algorithms be composed sta…
A class of polynomial dynamical systems called complex-balanced are locally stable and conjectured to be globally stable. In general, complex-balancing is not a robust property, i.e., small changes in parameter values may result in the loss…
Given a natural number N, one may ask what configuration of N points on the two-sphere minimizes the discrete generalized Coulomb energy. If one applies a gradient-based numerical optimization to this problem, one encounters many…
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we…
Given an unconditionally stable algorithm for solving the Cahn-Hilliard equation, we present a general calculation for an analytic time step $\d \tau$ in terms of an algorithmic time step $\dt$. By studying the accumulative multi-step error…
Stability selection (Meinshausen and Buhlmann, 2010) makes any feature selection method more stable by returning only those features that are consistently selected across many subsamples. We prove (in what is, to our knowledge, the first…
This paper uses the notion of algorithmic stability to derive novel generalization bounds for several families of transductive regression algorithms, both by using convexity and closed-form solutions. Our analysis helps compare the…
We prove that that second-order (double-loop) chaotic sigma-delta schemes are stable - within a certain parameter range, all state variables of the system are guaranteed to remain uniformly bounded. To our knowledge this is the first…
This paper deals with hybrid systems (HS) with fractional order dynamics and their stability. The stability of two particular types of fractional order hybrid systems (FOHS), i.e., switching and reset control systems, is studied. Common…
We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…
A well known result states that stability criterion for matchings in two-sided markets doesn't ensure uniqueness. This opens the door for a moral question with regard to the optimal stable matching from a social point of view. Here, a new…
We study the stability of linear fractional order maps. We show that in the stable region, the evolution is described by Mittag-Leffler functions and a well defined effective Lyapunov exponent can be obtained in these cases. For…
Component graphs $\Gamma_{0}(F)$ are defined for arrays of sets $F$, and in particular for arrays of path components for Vietoris-Rips complexes and Lesnick complexes. The path components of $\Gamma_{0}(F)$ are the {\it stable components}…
In this article we demonstrate and compare two modified versions of the classical finite section method for band-dominated operators in case the latter is not stable. For both methods we give explicit criteria for their applicability.
We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to diverse non-monotonic…
We introduce new sufficient conditions for verifying stability and recurrence properties in singularly perturbed stochastic hybrid dynamical systems. Specifically, we focus on hybrid systems with deterministic continuous-time dynamics that…
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…
Motivation: Many biochemical pathways are known, but the numerous parameters required to correctly explore the dynamics of the pathways are not known. For this reason, algorithms that can make inferences by looking at the topology of a…
We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable…
Based on the generalized Routh-Hurwitz criterion, we propose a sufficient and necessary criterion for testing the stability of fractional-order linear systems with order {\alpha}{\in}[1,2), called the fractional-order Routh-Hurwitz…
Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…