Related papers: Gromov hyperbolicity of minor graphs
Hyperbolic networks are supposed to be congruent with their underlying latent geometry and following geodesics in the hyperbolic space is believed equivalent to navigate through topological shortest paths (TSP). This assumption of…
On a hyperbolic surface homeomorphic to a torus with a puncture, each oriented simple geodesic inherits a well-defined relative twist number in $[0,1]$, given by the ratio to its hyperbolic length of the hyperbolic distance between the…
We prove a comparison theorem for certain types of polyhedra in a 3-manifold with its scalar curvature bounded below by $-6$. The result confirms in some cases the Gromov dihedral rigidity conjecture in hyperbolic $3$-space.
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$ or a shortest $v$-$w$ path that contains $u$. A set $W$ of…
The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…
A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
Many complex networks exhibit hierarchical, tree-like structures, making hyperbolic space a natural candidate wherein to learn representations of them. Based on this observation, Hyperbolic Graph Neural Networks (HGNNs) have been widely…
We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…
The class of coarsely convex spaces is a coarse geometric analogue of the class of nonpositively curved Riemannian manifolds. It includes Gromov hyperbolic spaces, CAT(0) spaces, proper injective metric spaces and systolic complexes. It is…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
An edge subset \( S \subseteq E(G) \) is called a 3-restricted edge-cut if $G-S$ is disconnected and each component of \( G - S \) contains at least three vertices. The 3-restricted edge-connectivity of a graph \( G \), denoted by \(…
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
For a graph $G$, the tree graph ${\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
We construct Patterson-Sullivan measure and a natural metric on the unit space of a hyperbolic groupoid. In particular, this gives a new approach to defining SRB measures on Smale spaces using Gromov hyperbolic graphs.
In the seminal work of Balogh-Buckley [Invent. Math. 2003], the authors asked the following fundamental open problem: for proper subdomains in the Euclidean space $\mathbb{R}^n$, does the ball separation condition alone imply the…