Related papers: Strongly Hyperbolic Unit Disk Graphs

Deep neural networks for graphs have emerged as a powerful tool for learning on complex non-euclidean data, which is becoming increasingly common for a variety of different applications. Yet, although their potential has been widely…

By analogy with complex numbers, a system of hyperbolic numbers can be introduced in the same way: z=x+h*y with h*h=1 and x,y real numbers. As complex numbers are linked to the Euclidean geometry, so this system of numbers is linked to 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…

We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…

Hyperbolic models are known to produce networks with properties observed empirically in most network datasets, including heavy-tailed degree distribution, high clustering, and hierarchical structures. As a result, several embeddings…

A multiarc and curve graph is a simplicial graph whose vertices are arc and curve systems on a compact, connected, orientable surface S. We show that all connected, non-trivial multiarc and curve graphs preserved by the natural action of…

Let $V\subset\mathbb{R}^2$ be a set of $n$ sites in the plane. The unit disk graph $DG(V)$ of $V$ is the graph with vertex set $V$ in which two sites $v$ and $w$ are adjacent if and only if their Euclidean distance is at most $1$. We…

A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in…

Spatial networks are networks whose graph topology is constrained by their embedded spatial space. Understanding the coupled spatial-graph properties is crucial for extracting powerful representations from spatial networks. Therefore,…

We show that a group that is hyperbolic relative to strongly shortcut groups is itself strongly shortcut, thus obtaining new examples of strongly shortcut groups. The proof relies on a result of independent interest: we show that every…

While contrastive self-supervised learning has become the de-facto learning paradigm for graph neural networks, the pursuit of higher task accuracy requires a larger hidden dimensionality to learn informative and discriminative…

We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…

We study subgroups of ${\rm PU}(2,1)$ generated by two non-commuting unipotent maps $A$ and $B$ whose product $AB$ is also unipotent. We call $\mathcal{U}$ the set of conjugacy classes of such groups. We provide a set of coordinates on…

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Deep learning has shown remarkable results on Euclidean data (e.g. audio, images, text) however this type of data is limited in the amount of relational information it can hold. In mathematics we can model more general relational data in a…

This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…

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…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor $C_{del\approx 2.42$; however,…

It is well known that \textit{every} Eulerian orientation of an Eulerian $2k$-edge connected (undirected) graph is strongly $k$-edge connected. An important goal in the area is to obtain analogous results for other types of connectivity,…