Related papers: Hyperbolicity vs. Amenability for planar graphs
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
When undergraduates ask me what geometric group theorists study, I describe a theorem due to Gromov which relates the groups with an intrinsic geometry like that of the hyperbolic plane to those in which certain computations can be…
We provide a simple, combinatorial criteria for a hierarchically hyperbolic space to be relatively hyperbolic by proving a new formulation of relative hyperbolicity in terms of hierarchy structures. In the case of clean hierarchically…
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…
It is shown that generalized trigonometric functions and generalized hyperbolic functions can be transformed from each other. As an application of this transformation, a number of properties for one immediately lead to the corresponding…
We introduce a graph $\Gamma$ which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary $\Omega$ of $\Gamma$. For $(\Omega_l)_{l\geq 1}$ a sequence of subraphs of $\Gamma$ such that…
We introduce hyperbolic attention networks to endow neural networks with enough capacity to match the complexity of data with hierarchical and power-law structure. A few recent approaches have successfully demonstrated the benefits of…
We discuss the connections tying Laplacian matrices to abstract duality and planarity of graphs.
Recent years have witnessed fast developments of graph neural networks (GNNs) that have benefited myriad graph analytic tasks and applications. Most GNNs rely on the homophily assumption that nodes belonging to the same class are more…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
We define analogues of the graphs of free splittings, of cyclic splittings, and of maximally-cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splits as…
We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
Learning from graph-structured data is an important task in machine learning and artificial intelligence, for which Graph Neural Networks (GNNs) have shown great promise. Motivated by recent advances in geometric representation learning, we…
The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…
We introduce two notions of hyperbolicity for not necessarily K\"ahler $n$-dimensional compact complex manifolds $X$. The first, called {\it balanced hyperbolicity}, generalises Gromov's K\"ahler hyperbolicity by means of Gauduchon's…
We show that every quasihyperbolic geodesic in a John space admitting a roughly starlike Gromov hyperbolic quasihyperbolization is a cone arc. This result provides a new approach to the elementary metric geometry question, formulated in…
Amenability is a notion of facial exposedness for convex cones that is stronger than being facially dual complete (or "nice") which is, in turn, stronger than merely being facially exposed. Hyperbolicity cones are a family of algebraically…
The ray graph is a Gromov hyperbolic graph on which the mapping class group of the plane minus a Cantor set acts by isometries. We give a description of the Gromov boundary of the ray graph in terms of cliques of long rays on the plane…