Related papers: Kinetic Stable Delaunay Graphs
We carry out a survey on curves defined over finite fields that are Diophantine stable; that is, with the property that the set of points of the curve is not altered under a proper field extension. First, we derive some general results of…
We present a new application of Lagrangian Perturbation Theory (LPT): the stability analysis of fluid flows. As a test case that demonstrates the framework we focus on the plane Couette flow. The incompressible Navier-Stokes equation is…
Evaluating a query over a large, irregular graph is inherently challenging. This challenge intensifies when solving a query over a sequence of snapshots of an evolving graph, where changes occur through the addition and deletion of edges.…
Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of…
We study the problem of maintaining robust and sparse overlay networks in fully distributed settings where nodes continuously join and leave the system. This scenario closely models real-world unstructured peer-to-peer networks, where…
Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…
Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…
Transformer-based models have recently shown success in representation learning on graph-structured data beyond natural language processing and computer vision. However, the success is limited to small-scale graphs due to the drawbacks of…
In this paper we characterize a function defined on the set of edges of a triangulated surface such that there is a spherical angle structure having the function as the edge invariant (or Delaunay invariant). We also characterize a function…
We pursue the study of edge-irregulators of graphs, which were recently introduced in [Fioravantes et al. Parametrised Distance to Local Irregularity. IPEC, 2024]. That is, we are interested in the parameter Ie(G), which, for a given graph…
The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the design of networks that are robust to faults under the assumption that any subset of edges up to a specific number can fail. We consider non-uniform…
We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…
In this article we show that the braid type of a set of $1$-periodic orbits of a non-degenerate Hamiltonian diffeomorphism on a surface is stable under perturbations which are sufficiently small with respect to the Hofer metric $d_{\rm…
In this work, we investigate the analysis of generators for dynamic graphs, which are defined as graphs whose topology changes over time. We introduce a novel concept, called ''sustainability,'' to qualify the long-term evolution of dynamic…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…
In \cite{Wu22}, under the uniformly acute condition, Wu showed the rigidity of the geodesic triangulated plane under Luo's discrete conformality. In this article, by modifying Wu's proof, we improve this result by weakening the uniformly…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
In this paper, we study the shape reconstruction problem, when the shape we wish to reconstruct is an orientable smooth d-dimensional submanifold of the Euclidean space. Assuming we have as input a simplicial complex K that approximates the…
This paper establishes the spectral stability in exponentially weighted spaces of smooth traveling monotone fronts for reaction diffusion equations of Fisher-KPP type with nonlinear degenerate diffusion coefficient. It is assumed that the…