Related papers: Some Stability Results on Graphs
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices $a$, $b$, $c$, $d$, $e$ and edges $ab$, $bc$, $cd$, $be$,…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
We provide explicit conditions for uniform stability, global asymptotic stability and uniform exponential stability for dynamic equations with a single delay and a nonnegative coefficient. Some examples on nonstandard time scales are also…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
We show that noncommutative analog of additive functional equation has Hyers-Ulam stability on amenable discrete quantum (semi)groups. This generalizes an old classical result.
In this paper, using the fixed point and direct methods, we prove the generalized Hyers-Ulam-Rassias stability of a Cauchy-Jensen additive functional equation in various normed spaces. The concept of Hyers-Ulam-Rassias stability originated…
We introduce a notion of stability for non-autonomous Hamiltonian flows on two-dimensional annular surfaces. This notion of stability is designed to capture the sustained twisting of particle trajectories. The main Theorem is applied to…
We develop local stable group theory directly from topological dynamics, and extend the main results in this subject to the setting of stability "in a model". Specifically, given a group $G$, we analyze the structure of sets $A\subseteq G$…
Graph Neural Networks (GNN) rely on graph convolutions to learn features from network data. GNNs are stable to different types of perturbations of the underlying graph, a property that they inherit from graph filters. In this paper we…
Understanding which system structure can sustain stable dynamics is a fundamental step in the design and analysis of large scale dynamical systems. Towards this goal, we investigate here the structural stability of systems with a random…
Let $n\ge1$ and $B\ge2$. A real-valued function $f$ defined on the $n$-simplex $\Delta_n$ is approximately convex with respect to $\Delta_{B-1}$ iff f(\sum_{i=1}^B t_ix_i) \le \sum_{i=1}^B t_if(x_i) +1 for all $x_1,...,x_B \in \Delta_n$ and…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
The paper studies wsat$(G,H)$ which is the minimum number of edges in a weakly $H$-saturated subgraph of $G$. We prove that wsat$(K_n,H)$ is `stable' - remains the same after independent removal of every edge of $K_n$ with constant…
It is known that hyperbolic non\-autonomous linear delay differential equations in a finite dimensional space are Hyers--Ulam stable and hence shadowable. The converse result is available only in the special case of autonomous and periodic…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…