Related papers: Limitations on Realistic Hyperbolic Graph Drawing
Hyperbolic geometry has emerged as a powerful tool for modeling complex, structured data, particularly where hierarchical or tree-like relationships are present. By enabling embeddings with lower distortion, hyperbolic neural networks offer…
Recently there was an increasing interest in applications of graph neural networks in non-Euclidean geometry; however, are non-Euclidean representations always useful for graph learning tasks? For different problems such as node…
After having investigated the real conic sections and their isoptic curves in the hyperbolic plane $\bH^2$ we consider the problem of the isoptic curves of generalized conic sections in the extended hyperbolic plane. This topic is widely…
While numerous approaches have been developed to embed graphs into either Euclidean or hyperbolic spaces, they do not fully utilize the information available in graphs, or lack the flexibility to model intrinsic complex graph geometry. To…
In classical Euclidean geometry, there are several equivalent definitions of conic sections. We show that in the hyperbolic plane, the analogues of these same definitions still make sense, but are no longer equivalent, and we discuss the…
This survey reviews hyperbolic graph embedding models, and evaluate them on anomaly detection, highlighting their advantages over Euclidean methods in capturing complex structures. Evaluating models like \textit{HGCAE},…
Complete hyperbolicity of small Euclidean balls with respect to a C^1-smooth almost complex structure standard at origin is improved to give a complete hyperbolicity of strictly pseudoconvex domains. More precise (and lower) regularity…
Mathematical objects are generally abstract and not very approachable. Illustrations and interactive visualizations help both students and professionals to comprehend mathematical material and to work with it. This approach lends itself…
Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ…
In this paper we introduce a new geometric flow --- the hyperbolic gradient flow for graphs in the $(n+1)$-dimensional Euclidean space $\mathbb{R}^{n+1}$. This kind of flow is new and very natural to understand the geometry of manifolds. We…
Hyperbolic geometry has recently found applications in social networks, machine learning and computational biology. With the increasing popularity, questions about the best representations of hyperbolic spaces arise, as each representation…
Let $f$ be a function that is analytic in the unit disc. We give new estimates, and new proofs of existing estimates, of the Euclidean length of the image under $f$ of a radial segment in the unit disc. Our methods are based on the…
Recent knowledge graph embedding (KGE) models based on hyperbolic geometry have shown great potential in a low-dimensional embedding space. However, the necessity of hyperbolic space in KGE is still questionable, because the calculation…
Here we give refined numerical values for the minimum number of vertices of $k$-chromatic unit distance graphs in the Euclidean plane.
In the paper Planarity and Hyperbolicity in Graphs, the authors present the following conjecture: every tessellation of the Euclidean plane with convex tiles induces a non-hyperbolic graph. It is natural to think that this statement holds…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
The article deals with the connection between the second postulate of Euclid and non-Euclidean geometry. It is shown that the violation of the second postulate of Euclid inevitably leads to hyperbolic geometry. This eliminates…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices $s,t$ ($s \neq t$), there is a neighbor vertex of $s$ that is closer to $t$ than to $s$ in the Euclidean distance. Greedy drawings are important in the…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…