Related papers: Limitations on Realistic Hyperbolic Graph Drawing
We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.
We discuss the Euclidean limit of hyperbolic SU(2)-monopoles, framed at infinity, from the point of view of pluricomplex geometry. More generally, we discuss the geometry of hypercomplex manifolds arising as limits of pluricomplex…
Non-Euclidean geometry, discovered by negating Euclid's parallel postulate, has been of considerable interest in mathematics and related fields for the description of geographical coordinates, Internet infrastructures, and the general…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
Object detection, for the most part, has been formulated in the euclidean space, where euclidean or spherical geodesic distances measure the similarity of an image region to an object class prototype. In this work, we study whether a…
Markov's theorem classifies the worst irrational numbers with respect to rational approximation and the indefinite binary quadratic forms whose values for integer arguments stay farthest away from zero. The main purpose of this paper is to…
We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We…
Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.
We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…
Hyperbolic geometry has emerged as an effective latent space for representing complex networks, owing to its ability to capture hierarchical organization and heterogeneous connectivity patterns using low-dimensional embeddings. As a result,…
Motivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et al., we introduce a dynamic model of hyperbolic graphs in…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
We study closed geodesics on hyperbolic surfaces, and give bounds for their angles of intersection and self-intersection, and for the sides of the polygons that they form, depending only on the lengths of the geodesics
Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter…
The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective spaces, and the conformal model of Euclidean space. Second…