Related papers: Periodic Euclidean Graphs on Integer Points
We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
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$…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…
An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…
We address discrete-time consensus on the Euclidean unit sphere. For this purpose we consider a distributed algorithm comprising the iterative projection of a conical combination of neighboring states. Neighborhoods are represented by a…
We prove that a Cayley graph can be embedded in the euclidean plane without accumulation points of vertices if and only if it is the 1-skeleton of a Cayley complex that can be embedded in the plane after removing redundant simplices. We…
A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$…
An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in…
Dot product embeddings take a graph and construct vectors for nodes such that dot products between two vectors give the strength of the edge. Dot products make a strong transitivity assumption, however, many important forces generating…
Recent research has shown that alignment between the structure of graph data and the geometry of an embedding space is crucial for learning high-quality representations of the data. The uniform geometry of Euclidean and hyperbolic spaces…
The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the…
Consider finitely many points in a geodesic space. If the distance of two points is less than a fixed threshold, then we regard these two points as "near". Connecting near points with edges, we obtain a simple graph on the points, which is…
Deformation K-theory associates to each discrete group G a spectrum built from spaces of finite dimensional unitary representations of G. In all known examples, this spectrum is 2-periodic above the rational cohomological dimension of G…
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on undirected graphs. However, Euclidean distances…
Graph transformers typically embed every node in a single Euclidean space, blurring heterogeneous topologies. We prepend a lightweight Riemannian mixture-of-experts layer that routes each node to various kinds of manifold, mixture of…
A unit spherical Euclidean distance matrix (EDM) D is a matrix whose entries can be realized as the interpoint (squared) Euclidean distances of n points on a unit sphere. In this paper, given such a D and 1 \leq k < l \leq n, we present a…
Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…