相关论文: When can forward stable algorithms be composed sta…

A theory is NIP (resp. stable) if and only if every formula with parameters in two single variables is NIP (resp. does not have the order property).

We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…

We consider the problems of characterizing and testing the stability of cellular automata configurations that evolve on a two-dimensional torus according to threshold rules with respect to the von-Neumann neighborhood. While stable…

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…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

We study the binary perceptron, a random constraint satisfaction problem that asks to find a Boolean vector in the intersection of independently chosen random halfspaces. A striking feature of this model is that at every positive constraint…

We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…

We prove a H\"{o}lder-logarithmic stability estimate for the problem of finding a sufficiently regular compactly supported function $v$ on $\mathbb{R}^d$ from its Fourier transform $\mathcal{F} v$ given on $[-r,r]^d$. This estimate relies…

We consider five different peer-to-peer file sharing systems with two chunks, with the aim of finding chunk selection algorithms that have provably stable performance with any input rate and assuming non-altruistic peers who leave the…

We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference…

We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose--accept rounds executed by the Gale--Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at…

We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions.…

Colloquially, there are two groups, $n$ men and $n$ women, each man (woman) ranking women (men) as potential marriage partners. A complete matching is called stable if no unmatched pair prefer each other to their partners in the matching.…

Let $\mathcal{H}_0$ denote the set of all sense-preserving harmonic mappings $f=h+\overline{g}$ in the unit disk $\ID$, normalized with $h(0)=g(0)=g'(0)=0$ and $h'(0)=1$. In this paper, we investigate some properties of certain subclasses…

Two genres of heuristics that are frequently reported to perform much better on "real-world" instances than in the worst case are greedy algorithms and local search algorithms. In this paper, we systematically study these two types of…

The aim of this paper is to present a new fast-convergent numerically stable space-time adaptive processing (STAP) algorithm derived using a novel technique of feedback orthogonalization. The main advantages of this approach lie in its…

We have numerically explored the stable planetary geometry for the multiple systems involved in a 2:1 mean motion resonance, and herein we mainly study the HD 82943 system by employing two sets of the orbital parameters (Mayor et al. 2004;…

Stable matching is a fundamental problem studied both in economics and computer science. The task is to find a matching between two sides of agents that have preferences over who they want to be matched with. A matching is stable if no pair…

We consider the possibility of the existence of a stable massive charged particle by a minimal extension of the standard model particle content. Absolute stability in the case of singly charged particle is not possible if the usual doublet…

We present several first-order and second-order numerical schemes for the Cahn-Hilliard equation with discrete unconditional energy stability. These schemes stem from the generalized Positive Auxiliary Variable (gPAV) idea, and require only…