Related papers: Effect of Gromov-hyperbolicity Parameter on Cuts a…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
These notes are the English version of the paper "Hyperbolicit\'e du graphe des rayons et quasi-morphismes sur un gros groupe modulaire". The mapping class group Gamma of the complement of a Cantor set in the plane arises naturally in…
In this paper, we investigate Gromov hyperbolizations of unbounded locally complete and incomplete metric spaces associated with three hyperbolic type metrics: the hyperbolization metric introduced by Ibragimov, the distance ratio metric,…
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes…
We wish to bring attention to a natural but slightly hidden problem, posed by Erd\H{o}s and Ne\v{s}et\v{r}il in the late 1980s, an edge version of the degree--diameter problem. Our main result is that, for any graph of maximum degree…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
To reinforce the analogy between the mapping class group and the Cremona group of rank $2$ over an algebraic closed field, we look for a graph analoguous to the curve graph and such that the Cremona group acts on it non-trivially. A…
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. The commonly used graph-based benchmark model R-MAT has some drawbacks…
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the structural properties that are observed in real world networks…
Let $\Gamma$ be a non-elementary Gromov-hyperbolic group, and $\partial \Gamma$ denote its Gromov boundary. We consider $\Gamma$-invariant proper $\delta$-hyperbolic, quasi-convex metric $d$ on $\Gamma$, and the associated…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
We investigate the relationship between the metric boundary and the Gromov boundary of a hyperbolic metric space. We show that the Gromov boundary is a quotient topological space of the metric boundary, and that therefore a word-hyperbolic…
Graph-structured data are widespread in real-world applications, such as social networks, recommender systems, knowledge graphs, chemical molecules etc. Despite the success of Euclidean space for graph-related learning tasks, its ability to…
We investigate the geometry of the graphs of nonseparating curves for surfaces of finite positive genus with potentially infinitely many punctures. This graph has infinite diameter and is known to be Gromov hyperbolic by work of the author.…
Recent studies have experimentally shown that we can achieve in non-Euclidean metric space effective and efficient graph embedding, which aims to obtain the vertices' representations reflecting the graph's structure in the metric space.…
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It has been observed recently that this strategy performs…
We establish some statistical properties of the hyperbolic times for a class of nonuniformly expanding dynamical systems. The maps arise as factors of area preserving maps of the unit square via a geometric Baker's map type construction,…
In the 1980s Alano Ancona developed a profound potential theory on Gromov hyperbolic manifolds of bounded geometry. Since then, such hyperbolic spaces have become basic in geometry, topology and group theory. In this paper we make Ancona's…