Related papers: Kinetic Stable Delaunay Graphs
In Euclidean 3-space endowed with a Cartesian reference system we consider a class of surfaces, called Delaunay tori, constructed by bending segments of Delaunay cylinders with neck-size $a$ and $n$ lobes along circumferences centered at…
We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
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…
This paper has two parts. In the first part, we review stable pairs and triples on curves, leading up to Thaddeus' diagram of flips and contractions starting from the blow-up of projective space along a curve embedded by a complete linear…
This paper presents a novel dynamic coverage control algorithm allowing a group of robots to track an optimal-deployment configuration for arbitrary time-varying density functions. Building on singular perturbation theory, the proposed…
The stability number of a graph $G$, denoted as $\alpha(G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lov\'asz's theta number and expanded through…
We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…
We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
The stability number of a graph, defined as the cardinality of the largest set of pairwise non-adjacent vertices, is NP-hard to compute. The exact subgraph hierarchy (ESH) provides a sequence of increasingly tighter upper bounds on the…
Analyzing the stability of graph neural networks (GNNs) under topological perturbations is key to understanding their transferability and the role of each architecture component. However, stability has been investigated only for particular…
Concepts like `typicality' and the `eigenstate thermalization hypothesis' aim at explaining the apparent equilibration of quantum systems, possibly after a very long time. However, these concepts are not concerned with the specific way in…
We address the question of what is the correct higher dimensional analogue of Jordan curves from the point of view of quantitative rectifiability. More precisely, we show that 'topologically stable' sets can be used as covering objects in…
We introduce a notion of stability for non-autonomous Hamiltonian flows on two-dimensional annular surfaces. This notion of stability is designed to capture the sustained twisting of particle trajectories. The main Theorem is applied to…
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…
When the coefficients of the cubic terms match the coefficients in the boundary conditions at a vertex of a star graph and satisfy a certain constraint, the nonlinear Schr\"{o}dinger (NLS) equation on the star graph can be transformed to…
In this work we introduce a topological method for the search of fixed points and periodic points for continuous maps defined on generalized rectangles in finite dimensional Euclidean spaces. We name our technique "Stretching Along the…
This paper examines stability properties of distance-based formation control when the underlying topology consists of a rigid graph and a flex node addition. It is shown that the desired equilibrium set is locally asymptotically stable but…
We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most…