Related papers: Strong stability from vertex-extendability and app…
This work proposes a novel distributed framework for verifying the incremental stability of large-scale systems with unknown dynamics and known interconnection structures using graph neural networks. Our proposed approach relies on the…
Given a sequence $\mathbf{k} := (k_1,\ldots,k_s)$ of natural numbers and a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…
In this paper, we sketch the proof of the extension of the stability theorem of the Minkowski space in General Relativity done explicitly in previous work by the present author. We discuss solutions of the Einstein vacuum (EV) equations. We…
Estimating the stability boundary is a fundamental and challenging problem in transient stability studies. It is known that a proper level set of a Lyapunov function or an energy function can provide an inner approximation of the stability…
As a variant of the famous Tur\'an problem, we study $\mathrm{rex}(n,F)$, the maximum number of edges that an $n$-vertex regular graph can have without containing a copy of $F$. We determine $\mathrm{rex}(n,K_{r+1})$ for all pairs of…
We study the linear stability problem to gravitational and electromagnetic perturbations of the extremal, $ |\mathcal{Q}|=M, $ Reissner-Nordstr\"om spacetime, as a solution to the Einstein-Maxwell equations. Our work uses and extends the…
This paper explores some sufficient conditions for the enhanced solvability of strong vector equilibrium problems, which can be established via a variational approach. Enhanced solvability here means existence of solutions, which are strong…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
Graph Neural Networks (GNNs) have become the standard for graph representation learning but remain vulnerable to structural perturbations. We propose a novel framework that integrates persistent homology features with stability…
The fundamental theorem of Tur\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between…
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 Hitchin-Kobayashi correspondence for vector bundles, established by Donaldson, Kobayashi, Luebke, Uhlenbeck and Yau, states that an indecomposable holomorphic vector bundle over a compact Kaehler manifold is stable in the sense of…
The classical Andr\'{a}sfai--Erd\H{o}s--S\'{o}s Theorem states that for $\ell\ge 2$, every $n$-vertex $K_{\ell+1}$-free graph with minimum degree greater than $\frac{3\ell-4}{3\ell-1}n$ must be $\ell$-partite. We establish a simple…
The stability of a galaxy model is most easily assessed through N-body simulation. Particle-mesh codes have been widely used for this purpose, since they enable the largest numbers of particles to be employed. We show that the functional…
In the early 1980s, Erd\H{o}s and S\'os initiated the study of the classical Tur\'an problem with a uniformity condition: the uniform Tur\'an density of a hypergraph $H$ is the infimum over all $d$ for which any sufficiently large…
Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Tur\'an numbers, a natural variation on the classical Tur\'an numbers for which the host graph is required to be regular. Among other results, we prove a striking…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
In this paper, we prove the stability of viscosity solutions of the Hamilton--Jacobi equations for a sequence of networks embedded in Euclidean space. The network considered in this paper is not merely a graph -- it comprises a collection…
While many questions in robust finance can be posed in the martingale optimal transport framework or its weak extension, others like the subreplication price of VIX futures, the robust pricing of American options or the construction of…
Work of D. Stern and Bray-Kazaras-Khuri-Stern provide differential-geometric identities which relate the scalar curvature of Riemannian 3-manifolds to global invariants in terms of harmonic functions. These quantitative formulas are useful…