Related papers: Stable Delaunay Graphs
While synchronized states, and the dynamical pathways through which they emerge, are often regarded as the paradigm to understand the dynamics of information spreading on undirected networks of nonlinear dynamical systems, when we consider…
A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk…
The existence, uniqueness, and asymptotic behavior of steady transonic flows past a curved wedge, involving transonic shocks, governed by the two-dimensional full Euler equations are established. The stability of both weak and strong…
For given natural numbers $d_1,d_2$ let $\Omega_2(d_1,d_2)$ be the set off all polynomial mappings $F=(f,g):\mathbb{C}^2\to\mathbb{C}^2$ such that deg $f\le d_1$, deg $g\le d_2$. We say that the mapping $F$ is topologically stable in…
Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…
The canonical double cover $\mathrm{D}(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(\Gamma))=\mathrm{Aut}(\Gamma)\times\mathbb{Z}_2$ then $\Gamma$ is called stable; otherwise $\Gamma$…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
The graph $G$ is said to be strongly regular with parameters $(n,k,\lambda,\mu)$ if the following conditions hold: (1) each vertex has $k$ neighbours; (2) any two adjacent vertices of $G$ have $\lambda$ common neighbours; (3) any two…
In this paper, the stability of fractional differential equations (FDEs) with unknown parameters is studied. FDEs bring many advantages to model the physical systems in the nature or man-made systems in the industry. Because this…
This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph $G$ and a set of terminal pairs $P$ and asks whether $G$ contains a set of pairwise edge-disjoint paths connecting every terminal…
This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe…
This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…
We study the Allen-Cahn equation with a cubic-quintic nonlinear term and a stochastic $Q$-trace-class stochastic forcing in two spatial dimensions. This stochastic partial differential equation (SPDE) is used as a test case to understand,…
A graph $\Gamma$ is said to be stable if for the direct product $\Gamma\times\mathbf{K}_2$, ${\rm Aut}(\Gamma \times \mathbf{K}_2)$ is isomorphic to ${\rm Aut}(\Gamma) \times \mathbb{Z}_2$; otherwise, it is called unstable. An unstable…
A plane graph is said to be a rectangular graph if each of its edges can be oriented horizontal or vertical, its internal regions are four-sided and it has a rectangular enclosure. If dual of a planar graph is a rectangular graph, then the…
We discover restrained numerical instabilities in current training practices of deep networks with stochastic gradient descent (SGD), and its variants. We show numerical error (on the order of the smallest floating point bit and thus the…
The Degasperis-Procesi (DP) equation is an integrable Camassa-Holm-type model as an asymptotic approximation for the unidirectional propagation of shallow water waves. This work is to establish the $L^2\cap L^\infty$ orbital stability of a…
A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…
We consider delay differential equations of the form $ y'(t)=-ay(t)+bf(y(t-1)) $ with positive parameters $a,b$ and a unimodal $f:[0,\infty)\to [0,1]$. It is assumed that the nonlinear $f$ is close to a function $g:[0,\infty)\to [0,1]$ with…