Related papers: Some Stability Results on Graphs
In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the…
In this work, we study the problem of stability of Graph Convolutional Neural Networks (GCNs) under random small perturbations in the underlying graph topology, i.e. under a limited number of insertions or deletions of edges. We derive a…
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…
This paper studies the graph-theoretic conditions for stability of positive monotone systems. Using concepts from input-to-state stability and network small-gain theory, we first establish necessary and sufficient conditions for the…
We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…
We prove that the elliptic Harnack inequality (on a manifold, graph, or suitably regular metric measure space) is stable under bounded perturbations, as well as rough isometries.
Graph neural networks are experiencing a surge of popularity within the machine learning community due to their ability to adapt to non-Euclidean domains and instil inductive biases. Despite this, their stability, i.e., their robustness to…
This paper provides sufficient conditions for global asymptotic stability and global exponential stability, which can be applied to nonlinear, large-scale, uncertain discrete-time systems. The conditions are derived by means of vector…
In this paper, we extend and refine previous Tur\'an-type results on graphs with a given circumference. Let $W_{n,k,c}$ be the graph obtained from a clique $K_{c-k+1}$ by adding $n-(c-k+1)$ isolated vertices each joined to the same $k$…
The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
The recent results of An, Luan, and Yen [Differential stability in convex optimization via generalized polyhedrality. Vietnam J. Math. https://-doi.org/10.1007/s10013-024-00721-y] on differential stability of parametric optimization…
We prove that for a wide family of non-uniformly hyperbolic maps and hyperbolic potentials we have equilibrium stability, i.e. the equilibrium states depend continuously on the dynamics and the potential. For this we deduce that the…
An $r$-uniform hypergraph ($r$-graph) is linear if any two edges intersect at most one vertex. For a graph $F$, a hypergraph $H$ is Berge-$F$ if there is a bijection $\phi:E(F)\rightarrow E(H)$ such that $e\subseteq \phi(e)$ for all $e$ in…
The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…
We present a notion of $\Delta$-stability and stability filtration in arbitrary categories which is equivalent to the existence of Harder-Narasimhan (HN) sequences on objects. Indeed it is equivalent to the existence of a zero morphism, a…
Given a graph $F$, a hypergraph is called a Berge-$F$ if it can be obtained by expanding each edge of $F$ into a hyperedge containing it. Let $M_{k}$ denote the matching of size $k$. Kang, Ni, and Shan [12] determined the Tur\'an number of…
In this paper, we investigate the asymptotic behaviors of the solutions of nonlinear dynamic systems nearby an equilibrium point, when the nominal parts are subject to non necessarily small perturbations. We show that, under some estimates…
In this work, we establish an analogue result of the Erd\"os-Stone theorem of weighted digraphs using Regularity Lemma of digraphs. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangle and…
In this paper, by using the orthogonally fixed point method, we prove the Hyers-Ulam stability and the hyperstability of orthogonally 3-Lie homomorphisms for additive $\rho$-functional equation in 3-Lie algebras.\\ Indeed, we investigate…