Related papers: Some Stability Results on Graphs
A \v{S}olt\'es' hypergraph is a hypergraph for which the removal of any of its vertices does not change its total distance. We prove that every uniform \v{S}olt\'es' hypergraph has order at least $10$, there exist uniform \v{S}olt\'es'…
This paper discusses the interplay of symmetries and stability in the analysis and control of nonlinear dynamical systems and networks. Specifically, it combines standard results on symmetries and equivariance with recent convergence…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
Hyers-Ulam of the sequence $ \{z_n\}_{n \in \mathbb{N}} $ satisfying the difference equation $ z_{i+1} = g(z_i) $ where $ g(z) = \frac{az + b}{cz + d} $ with complex numbers $ a $, $ b $, $ c $ and $ d $ is defined. Let $ g $ be loxodromic…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
The Erd\H{o}s-Gallai Theorem states that every graph of average degree more than $l-2$ contains a path of order $l$ for $l\ge 2$. In this paper, we obtain a stability version of the Erd\H{o}s-Gallai Theorem in terms of minimum degree. Let…
In this paper we will study Hyers-Ulam stability for Bernoulli differential equations, Riccati differential equations and quasilinear partial differential equations of first order, using Gronwall Lemma, following a method given by Rus.
The aim of this paper is to give two uniqueness results for the Dirichlet problem associated to the constant mean curvature equation. We study constant mean curvature graphs over strips of R^2. The proofs are based on height estimates and…
In the problem of structured prediction with graph representation learning (GRL for short), the hypothesis returned by the algorithm maps the set of features in the \emph{receptive field} of the targeted vertex to its label. To understand…
Graph neural networks (GNNs) provide state-of-the-art results in a wide variety of tasks which typically involve predicting features at the vertices of a graph. They are built from layers of graph convolutions which serve as a powerful…
In this paper, we present new results on finite- and fixed-time convergence for dynamical systems using LaSalle-like invariance principles. In particular, we provide first and second-order non-smooth Lyapunov-like results for finite- and…
We study the weak $K_s$-saturation number of the Erd\H{o}s--R\'{e}nyi random graph $\mathbbmsl{G}(n, p)$, denoted by $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$, where $K_s$ is the complete graph on $s$ vertices. Kor\'{a}ndi and Sudakov in…
Static equilibrium configurations of continua supported by surface tension are given by constant mean curvature (CMC) surfaces which are critical points of a variational problem to extremize the area while keeping the volume fixed. CMC…
Network-topology inference from (vertex) signal observations is a prominent problem across data-science and engineering disciplines. Most existing schemes assume that observations from all nodes are available, but in many practical…
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…
To our knowledge, the analysis of convergence rates for persistence diagrams estimation from noisy signals has predominantly relied on lifting signal estimation results through sup-norm (or other functional norm) stability theorems. We…
We establish the best (minimum) constant for Ulam stability of first-order linear $h$-difference equations with a periodic coefficient. First, we show Ulam stability and find the Ulam stability constant for a first-order linear equation…
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…