相关论文: When can forward stable algorithms be composed sta…
In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a…
C. Gordon conjectured that a connected sum of two Heegaard splittings is stabilized if and only if one of the two factors is stabilized (Problem 3.91 in Kirby's problem list). In this paper, we shall prove this conjecture.
Structural stability is a necessary condition for successful construction of an assembly. However, designing a stable assembly requires a non-trivial effort since a slight variation in the design could significantly affect the structural…
In this paper, we mainly consider the stability of $ \Phi_{S, F,H} $ harmonic map and $ \Phi_{T,F,H} $ harmonic map from or into $ \Phi $-SSU manifold. We mainly consider the stability of $ \Phi_{S, F,H} $ harmonic map and $ \Phi_{T,F,H} $…
In our previous work, it was shown that the topology of an event horizon (EH) is determined by the past endpoints of the EH. A torus EH (the collision of two EH) is caused by the two-dimensional (one-dimensional) set of the endpoints. In…
The unique continuation on quadratic curves for harmonic functions is discussed in this paper. By using complex extension method, the conditional stability of unique continuation along quadratic curves for harmonic functions is illustrated.…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
State space subspace algorithms for input-output systems have been widely applied but also have a reasonably well-developedasymptotic theory dealing with consistency. However, guaranteeing the stability of the estimated system matrix is a…
In a stable matching problem there are two groups of agents, with agents on one side having their individual preferences for agents on another side as a potential match. It is assumed silently that agents can freely and costlessly ``switch"…
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $N$- length signals with known frequency support of size $k$. A typical algorithm, in this case, would involve solving…
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…
Bagging is an important technique for stabilizing machine learning models. In this paper, we derive a finite-sample guarantee on the stability of bagging for any model. Our result places no assumptions on the distribution of the data, on…
An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. In this paper, we solve various open problems concerning the computational complexity of stable partitions in additively…
There have been several existence results for the standing waves of FitzHugh-Nagumo equations. Such waves are the connecting orbits of an autonomous second-order Lagrangian system and the corresponding kinetic energy is an indefinite…
Randomly-assembled dynamical systems are theoretically predicted to be unstable upon crossing a critical threshold of complexity, as first shown by May. Yet, empirical complex systems exhibit remarkable stability, indicating the presence of…
For $\alpha\in [1,2)$ we consider operators of the form $$L f(x)=\int_{R^d} [f(x+h)-f(x)-1_{(|h|\leq 1)} \nabla f(x)\cdot h] \frac{A(x,h)}{|h|^{d+\alpha}}$$ and for $\alpha\in (0,1)$ we consider the same operator but where the $\nabla f$…
In this article we study the stable marriage game induced by the men-proposing Gale-Shapley algorithm. Our setting is standard: all the lists are complete and the matching mechanism is the men-proposing Gale-Shapley algorithm. It is well…
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…
We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…
Motivated by data on coauthorships in scientific publications, we analyze a team formation process that generalizes matching models and network formation models, allowing for overlapping teams of heterogeneous size. We apply different…