Related papers: Traffic Congestion in Expanders, $(p,\delta)$--Hyp…
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in…
A bramble in an undirected graph $G$ is a family of connected subgraphs of $G$ such that for every two subgraphs $H_1$ and $H_2$ in the bramble either $V(H_1) \cap V(H_2) \neq \emptyset$ or there is an edge of $G$ with one endpoint in…
By a geodesic subspace of a metric space $X$ we mean a subset $A$ of $X$ such that any two points in $A$ can be connected by a geodesic in $A$. It is easy to check that a geodesic metric space $X$ is an $\mathbb{R}$-tree (that is, a…
If X is a geodesic metric space and $x_1,x_2,x_3\in X$, a {\it geodesic triangle} $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-\emph{hyperbolic} $($in the…
Let $\mathcal{C}(S_{g,p})$ denote the curve complex of the closed orientable surface of genus $g$ with $p$ punctures. Masur-Minksy and subsequently Bowditch showed that $\mathcal{C}(S_{g,p})$ is $\delta$-hyperbolic for some…
If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a {\it geodesic triangle} $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-\emph{hyperbolic} $($in the…
We revisit the classic problem of determining optimal routes in a graph for transporting two given distributions defined on its nodes, originally studied by Wardrop and Beckmann in the 1950s. The global congestion profile at any given time…
We extend the Aw-Rascle macroscopic model of car traffic into a two-way multi-lane model of pedestrian traffic. Within this model, we propose a technique for the handling of the congestion constraint, i.e. the fact that the pedestrian…
The Spanning Tree Congestion (STC) problem is the following NP-hard problem: given a graph $G$, construct a spanning tree $T$ of $G$ minimizing its maximum edge congestion where the congestion of an edge $e\in T$ is the number of edges $uv$…
We show that a geodesic metric space is hyperbolic in the sense of Gromov if and only if intersections of balls have bounded eccentricity. In particular, $\R$-trees are characterized among geodesic metric spaces by the property that the…
We investigate the impact the negative curvature has on the traffic congestion in large-scale networks. We prove that every Gromov hyperbolic network $G$ admits a core, thus answering in the positive a conjecture by Jonckheere, Lou,…
We prove that any $n$-node graph $G$ with diameter $D$ admits shortcuts with congestion $O(\delta D \log n)$ and dilation $O(\delta D)$, where $\delta$ is the maximum edge-density of any minor of $G$. Our proof is simple, elementary, and…
In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin in 2003. The model usually considers a deterministic graph…
Embedding the vertices of arbitrary graphs into trees while minimizing some measure of overlap is an important problem with applications in computer science and physics. In this work, we consider the problem of bijectively embedding the…
We described the average traffic congestion in several populous cities around the world from a new concept, namely landscape percolation. The ratio of the residential area size to road width is a fundamental parameter that controls the…
Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths…
Let X be a geodesic metric space. Gromov proved that there exists k>0 such that if every sufficiently large triangle T satisfies the Rips condition with constant k times pr(T), where pr(T) is the perimeter T, then X is hyperbolic. We give…
In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to…
Consider the tesselation of the hyperbolic plane by m-gons, l per vertex. In its 1-skeleton, we compute the growth series of vertices, geodesics, tuples of geodesics with common extremities. We also introduce and enumerate "holly trees", a…
In arXiv math.MG/0207296 we introduced a product construction for locally compact, complete, geodesic hyperbolic metric spaces. In the present paper we define the hyperbolic product for general Gromov-hyperbolic spaces. In the case of…