Related papers: Effect of Gromov-hyperbolicity Parameter on Cuts a…
In this paper we study the hyperbolicity in the sense of Gromov of domains in $\mathbb{R}^d$ $(d\geq3)$ with respect to the minimal metric introduced by Forstneri\v{c} and Kalaj. In particular, we prove that every bounded strongly minimally…
Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of…
In [BBM21], Belk, Bleak and Matucci proved that hyperbolic groups can be seen as subgroups of the rational group. In order to do so, they associated a tree of atoms to each hyperbolic group. Not so many connections between this tree and the…
In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…
We investigate minimal solutions of the Allen-Cahn equation on a Gromov-hyperbolic graph. Under some natural conditions on the graph, we show the existence of non-constant uniformly-bounded minimal solutions with prescribed asymptotic…
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…
In 2015, Dankelmann and Bau proved that for every bridgeless graph $G$ of order $n$ and minimum degree $\delta$ there is an orientation of diameter at most $11\frac{n}{\delta+1}+9$. In 2016, Surmacs reduced this bound to…
Let $\Sigma$ be a compact, orientable surface of genus $g$, and let $\Gamma$ be a relation on $\pi_0(\partial \Sigma)$ such that the prescribed arc graph $\mathcal{A}(\Sigma,\Gamma)$ is Gromov-hyperbolic and non-trivial. We show that…
The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London…
Predicting Internet round-trip time (RTT) is critical for routing optimization, quality-of-service (QoS) provisioning, and traffic engineering, yet remains challenging due to long-term temporal dependencies, evolving routing dynamics, and…
Conditional lower bounds for dynamic graph problems has received a great deal of attention in recent years. While many results are now known for the fully-dynamic case and such bounds often imply worst-case bounds for the partially dynamic…
We define hyperbolic groupoids, generalizing the notion of a Gromov hyperbolic group. Examples of hyperbolic groupoids include actions of Gromov hyperbolic groups on their boundaries, pseudogroups generated by expanding self-coverings,…
In 1964, Golod and Shafarevich found that, provided that the number of relations of each degree satisfy some bounds, there exist infinitely dimensional algebras satisfying the relations. These algebras are called Golod-Shafarevich algebras.…
Graph representation learning in Euclidean space, despite its widespread adoption and proven utility in many domains, often struggles to effectively capture the inherent hierarchical and complex relational structures prevalent in real-world…
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best…
A graph $G=(V,E)$ is $\delta$-hyperbolic if for any four vertices $u,v,w,x$, the two larger of the three distance sums $d(u,v)+d(w,x)$, $d(u,w)+d(v,x)$, and $d(u,x)+d(v,w)$ differ by at most $2\delta \geq 0$. Recent work shows that many…
In this article, we initiate a geometric study of graph braid groups. More precisely, by applying the formalism of special colorings introduced in a previous article, we determine precisely when a graph braid group is Gromov-hyperbolic,…
We introduce graph width parameters, called $\alpha$-edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decomposition. They are motivated by edge-cut width, recently…
Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of…
We study the interplay between the backward dynamics of a non-expanding self-map $f$ of a proper geodesic Gromov hyperbolic metric space $X$ and the boundary regular fixed points of $f$ in the Gromov boundary. To do so, we introduce the…