Related papers: Some Stability Results on Graphs
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
This work investigates the morphological stability of a soft body composed of two heavy elastic layers, attached to a rigid surface and subjected only to the bulk gravity force. Using theoretical and computational tools, we characterize the…
We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…
Recent interest in the external validity of prediction models (i.e., the problem of different train and test distributions, known as dataset shift) has produced many methods for finding predictive distributions that are invariant to dataset…
In this paper we obtain the stability theorem for the independence number of $G(n, r, 1)$ graphs. This result was previously stated in the paper of M. Pyaderkin but the proof there was incorrect. We introduce the correct proof of the key…
A graph $\Gamma$ is said to be stable if $\mathrm{Aut}(\Gamma\times K_2)\cong\mathrm{Aut}(\Gamma)\times \mathbb{Z}_{2}$ and unstable otherwise. If an unstable graph is connected, non-bipartite and any two of its distinct vertices have…
We consider a thin and narrow rectangular plate where the two short edges are hinged whereas the two long edges are free. This plate aims to represent the deck of a bridge, either a footbridge or a suspension bridge. We study a nonlocal…
In this work, we prove an existence theorem of the Hyers-Ulam stability for the nonlinear Volterra integral equations which improves and generalizes Castro-Ramos theorem by using some weak conditions.
Graph convolutional neural networks (GCNNs) have emerged as powerful tools for analyzing graph-structured data, achieving remarkable success across diverse applications. However, the theoretical understanding of the stability of these…
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…
These notes are a self-contained short proof of the stability of persistence diagrams.
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…
The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a five-point condition. Restricted to graphs, it is closely…
Let $M$ be a manifold, $V$ be a vector field on $M$, and $B$ be a Banach space. For any fixed function $f:M\rightarrow B$ and any fixed complex number $\lambda$, we study Hyers-Ulam stability of the global differential equation $Vy=\lambda…
We consider variational and stability properties of a system of two coupled nonlinear Schr\"{o}dinger equations on the star graph $\Gamma$ with the $\delta$ coupling at the vertex of $\Gamma$. The first part is devoted to the proof of an…
Two-sample tests utilizing a similarity graph on observations are useful for high-dimensional and non-Euclidean data due to their flexibility and good performance under a wide range of alternatives. Existing works mainly focused on sparse…
We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices $a, b, c, d, e$ and edges $ab, bc, cd,…
We establish a rigidity theorem for Brendle and Hung's recent systolic inequality, which involves Gromov's notion of \(T^{\rtimes}\)-stabilized scalar curvature. Our primary technique is the construction of foliations by free boundary…
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…