𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scaled Gromov hyperbolic graphs

✍ Scribed by Edmond Jonckheere; Poonsuk Lohsoonthorn; Francis Bonahon

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
258 KB
Volume
57
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this article, the δ‐hyperbolic concept, originally developed for infinite graphs, is adapted to very large but finite graphs. Such graphs can indeed exhibit properties typical of negatively curved spaces, yet the traditional δ‐hyperbolic concept, which requires existence of an upper bound on the fatness δ of the geodesic triangles, is unable to capture those properties, as any finite graph has finite δ. Here the idea is to scale δ relative to the diameter of the geodesic triangles and use the Cartan–Alexandrov–Toponogov (CAT) theory to derive the thresholding value of δdiam below which the geometry has negative curvature properties. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 157–180, 2008

📜 SIMILAR VOLUMES

Pseudoconvexity and Gromov hyperbolicity
Pseudoconvexity and Gromov hyperbolicity
✍ Zoltan M. Balogh; Mario Bonk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 424 KB

We give an estimate for the distance functions related to the Bergman, Carathkodory, and Kobayashi metrics on a bounded strictly pseudoconvex domain with C'-smooth boundary. Our formula relates the distance function on the domain with the Carnot-Carathkodory metric on the boundary. As a corollary we

Hyperbolic Bridged Graphs
Hyperbolic Bridged Graphs
✍ Jack H. Koolen; Vincent Moulton 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Given a connected graph G, we take, as usual, the distance x y between any two vertices x, y of G to be the length of some geodesic between x and y. The graph G is said to be δ-hyperbolic, for some δ ≥ 0, if for all vertices x, y, u, v in G the inequality holds, and G is bridged if it contains no f

On a Lemma of Gromov and the Entropy of
On a Lemma of Gromov and the Entropy of a Graph
✍ Fabio Scarabotti 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 42 KB

If G is a finite, directed, simple and irreducible graph, deletion of an edge makes the entropy decrease. We give a proof of this fact that avoids the Perron-Frobenius theorem and makes use of a technique developed by Gromov.

Hyperbolicity and complement of graphs
Hyperbolicity and complement of graphs
✍ Sergio Bermudo; José M. Rodríguez; José M. Sigarreta; Eva Tourís 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 280 KB

If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = {x 1 , x 2 , x 3 } is the union of the three geodesics [x 1 x 2 ], [x 2 x 3 ] and [x 3 x 1 ] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of th

When is the graph product of hyperbolic
When is the graph product of hyperbolic groups hyperbolic?
✍ John Meier 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 771 KB

Given a finite simplicial graph G, and an assignment of groups to the vertices of if, the graph product is the free product of the vertex groups modulo relations implying that adjacent vertex groups commute. We use Gromov's link criteria for cubical complexes and techniques of Davis and Moussang to