Related papers: Some Stability Results on Graphs
In this paper the following implication is verified for certain basic algebraic curves: if the additive real function $f$ approximately (i.e., with a bounded error) satisfies the derivation rule along the graph of the algebraic curve in…
We establish the Hyers-Ulam stability of a second-order linear Hill-type $h$-difference equation with a periodic coefficient. Using results from first-order $h$-difference equations with periodic coefficient of arbitrary order, both…
The main purpose of this paper is to obtain necessary and sufficient conditions under which a nonautonomous, finite-dimensional and two-sided dynamics generated by a sequence of matrices or a linear ODE exhibits Hyers-Ulam stability.…
We prove a stability theorem for the elliptic Harnack inequality: if two weighted graphs are equivalent, then the elliptic Harnack inequality holds for harmonic functions with respect to one of the graphs if and only if it holds for…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…
The first order difference equation induced by the sequence of maps on $ \mathbb{C} $ has Hyers-Ulam stability where the limit of the geometric average of growth rate is convergent and not equal to one. %The average growth rate is a…
We explore the Hyers-Ulam stability of perturbations for a homogeneous linear differential system with $2\times 2$ constant coefficient matrix. New necessary and sufficient conditions for the linear system to be Hyers-Ulam stable are…
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a…
We establish the Hyers-Ulam stability of certain linear first-order differential equations with singularities. We then extend these results to higher-order singular linear differential equations that can be written with these first-order…
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
Hyers-Ulam stability of the difference equation $ z_{n+1} = a_nz_n + b_n $ is investigated. If $ \prod_{j=1}^{n}|a_j| $ has subexponential growth rate, then difference equation generated by linear maps has no Hyers-Ulam stability. Other…
It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…
We establish the stability of higher-order linear non-homogeneous Cauchy-Euler dynamic equations on time scales in the sense of Hyers and Ulam. That is, if an approximate solution of a higher-order Cauchy-Euler equation exists, then there…
We establish the stability of second-order linear dynamic equations on time scales in the sense of Hyers and Ulam. To wit, if an approximate solution of the second-order linear equation exists, then there exists an exact solution to the…
Graph-based tests are a class of non-parametric two-sample tests useful for analyzing high-dimensional data. The test statistics are constructed from similarity graphs (such as K-minimum spanning tree), and consequently, their performance…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
We investigate stability of a solution of a hybrid system in the sense that the graphs of solutions from nearby initial conditions remain close and tend towards the graph of the given solution. In this manner, a small continuous-time…
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…