Related papers: Some Stability Results on Graphs
Hyre-Ulam stability of functional equation in single variable is studied in non-triangular metric spaces. We derive it as applications of some fixed point results developed on the said structure. A general version of Baker's theorem is also…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
In this paper, we examine the Hyers-Ulam and Hyers-Ulam-Rassias stability of solutions of a general class of nonlinear Volterra integral equations. By using a fixed point alternative and improving a technique commonly used in similar…
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…
In this paper we study the continuous dependence with respect to obstacles for obstacle problems with measure data. This is deeply investigated introducing a suitable type of convergence, which gives stability under very general hypotheses.…
The foundation of locally convex cone theory relies on order-theoretic concepts that induce specific topological frameworks. Within this structure, cones naturally possess three distinct topologies: lower, upper, and symmetric. In this…
This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…
A graph $ G $ is said to be $ (H;k) $-vertex stable if $ G $ contains a~subgraph isomorphic to $ H $ even after removing any $ k $ of its vertices alongside with their incident edges. We will denote by $ \text{stab}(H;k) $ the minimum size…
We prove that small nonlinear perturbations of random linear dynamics admitting a tempered exponential dichotomy have a random version of the shadowing property. As a consequence, if the exponential dichotomy is uniform, we get that the…
In this article, we study finite dynamical systems defined over graphs, where the functions are applied asynchronously. Our goal is to quantify and understand stability of the dynamics with respect to the update sequence, and to relate this…
This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…
We consider the incompressible Euler equations in $R^2$ when the initial vorticity is bounded, radially symmetric and non-increasing in the radial direction. Such a radial distribution is stationary, and we show that the monotonicity…
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…
We clarify the Hyers--Ulam stability (HUS) of certain first-order linear constant coefficient dynamic equations on time scales, in the case of a specific time scale with two alternating step sizes, where the exponential function changes…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…
In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas…
The aim of this work is to establish a linear instability criterium of stationary solutions for the Korteweg-de Vries model on a star graph with a structure represented by a finite collections of semi-infinite edges. By considering a…
Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and algorithmic properties of hereditary graph classes, and are considered key notions for generalizing to hereditary…
The classical Kruskal-Katona theorem gives a tight upper bound for the size of an $r$-uniform hypergraph $\mathcal{H}$ as a function of the size of its shadow. Its stability version was obtained by Keevash who proved that if the size of…