Related papers: Stable Delaunay Graphs

We consider non-degenerate SDEs with a $\beta$-Holder continuous and bounded drift term and driven by a Levy noise $L$ which is of $\alpha$-stable type. If $\alpha \in [1,2)$ and $\beta \in (1 - \frac{\alpha}{2},1) $ we show pathwise…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as…

Classical optimisation theory guarantees monotonic objective decrease for gradient descent (GD) when employed in a small step size, or ``stable", regime. In contrast, gradient descent on neural networks is frequently performed in a large…

Let $D$ be a digraph. Given a set of vertices $S \subseteq V(D)$, an $S$-path partition $\mathcal{P}$ of $D$ is a collection of paths of $D$ such that $\{V(P) \colon P \in \mathcal{P}\}$ is a partition of $V(D)$ and $|V(P) \cap S| = 1$ for…

We study the problem of embedding graphs in the plane as good geometric spanners. That is, for a graph $G$, the goal is to construct a straight-line drawing $\Gamma$ of $G$ in the plane such that, for any two vertices $u$ and $v$ of $G$,…

We consider a distance-regular graph $\Gamma=(X, \mathcal R)$ called the bilinear forms graph $H_q(D,N-D)$; we assume $N>2D\geq 6$ and $q \not=2$. We show that $\Gamma$ satisfies the following strengthened version of the balanced set…

We study the nonlinear Schr\"odinger equation (NLS) on a star graph $\mathcal{G}$. At the vertex an interaction occurs described by a boundary condition of delta type with strength $\alpha\in \mathbb{R}$. We investigate an orbital…

This paper deals with the global stability of time-delayed dynamical networks. We show that for a time-delayed dynamical network with non-distributed delays the network and the corresponding non-delayed network are both either globally…

Traditional analyses of gradient descent show that when the largest eigenvalue of the Hessian, also known as the sharpness $S(\theta)$, is bounded by $2/\eta$, training is "stable" and the training loss decreases monotonically. Recent…

There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree…

Let $\mathcal{T}$ be a finite nonempty set of $3$-element subsets of a totally ordered set $V$. We view $\mathcal{T}$ as the set of triangles in the support graph. Let $\delta_{1,\mathcal{T}}$ be the signed edge-triangle incidence matrix,…

Let $D$ be a digraph. A stable set $S$ of $D$ and a path partition $\mathcal{P}$ of $D$ are orthogonal if every path $P \in \mathcal{P}$ contains exactly one vertex of $S$. In 1982, Berge defined the class of $\alpha$-diperfect digraphs. A…

The collection of all non-degenerate, continuous, two-piece, piecewise-linear maps on $\mathbb{R}^2$ can be reduced to a four-parameter family known as the two-dimensional border-collision normal form. We prove that throughout an open…

Stability is a fundamental notion in dynamical systems and control theory that, traditionally understood, describes asymptotic behavior of solutions around an equilibrium point. This notion may be characterized abstractly as continuity of a…

In an excitable Delaunay triangulation every node takes three states (resting, excited and refractory) and updates its state in discrete time depending on a ratio of excited neighbours. All nodes update their states in parallel. By varying…

Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…

The real Ginzburg-Landau equation possesses a family of spatially periodic equilibria. If the wave number of an equilibrium is strictly below the so called Eckhaus boundary the equilibrium is known to be spectrally and diffusively stable,…

We say that a graph G is $(k,\ell)$-stable if removing $k$ vertices from it reduces its independence number by at most $\ell$. We say that G is tight $(k,\ell)$-stable if it is $(k,\ell)$-stable and its independence number equals…

A (2-dimensional) realisation of a graph $G$ is a pair $(G,p)$, where $p$ maps the vertices of $G$ to $\mathbb{R}^2$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We…