Cited by 1,817Geometric and Algebraic TopologyGeometric Analysis and Curvature FlowsMathematics and Applications

Hyperbolic Groups

Gromov, M.·1987·Mathematical Sciences Research Institute Publications

Integrity signals

Registry

Crossref · 10.1007/978-1-4613-9586-7_3

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Hyperbolic spaces provably model tree-like structures better than Euclidean geometry.

    “Following prior work, we first advocate for using hyperbolic spaces which provably model tree-like structures better than Euclidean geometry.”

    From Hyperbolic Entailment Cones for Learning Hierarchical Embeddings (2018) · cites this paper as Gromov, 1987

  • Euclidean space R^n for n ≥ 2 is not δ-hyperbolic for any δ ≥ 0, while the Poincaré ball D^n is log(1+√2)-hyperbolic.

    “For instance, the Euclidean space R n for n ≥ 2 is not δ -hyperbolic for any δ ≥ 0 , while the Poincar´ e ball D n is log(1+ √ 2) -hyperbolic.”

    From Hyperbolic Entailment Cones for Learning Hierarchical Embeddings (2018) · cites this paper as Gromov, 1987

  • For any δ > 0, any δ-hyperbolic metric space and any set of points, there exists a finite weighted tree and an embedding f such that for all i, j, a distance condition holds.

    “Theorem : For any δ > 0 , any δ -hyperbolic metric space ( X,d X ) and any set of points x 1 , ..., x n ∈ X , there exists a finite weighted tree ( T, d T ) and an embedding f : T → X such that for all i, j ,”

    From Hyperbolic Entailment Cones for Learning Hierarchical Embeddings (2018) · cites this paper as Gromov, 1987

  • The exponential growth property enables hyperbolic spaces to embed any weighted tree while almost preserving their metric.

    “This exponential growth property enables hyperbolic spaces to embed any weighted tree while almost preserving their metric 3 (Gromov, 1987; Bowditch, 2006; Sarkar, 2011).”

    From Hyperbolic Entailment Cones for Learning Hierarchical Embeddings (2018) · cites this paper as Gromov, 1987

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Gromov, M.
Corresponding author
Gromov, M.
Venue
Mathematical Sciences Research Institute Publications
Published
1987
Pages
75-263
ISSN
0940-4740 (ISSN-L)
OpenAlex
W4235484205
Cited by
1,817
References
19
Citations by year
2026: 41 · 2025: 106 · 2024: 94 · 2023: 92 · 2022: 87 · 2021: 90 · 2020: 72 · 2019: 69 · 2018: 72 · 2017: 82 · 2016: 79 · 2015: 75 · 2014: 68 · 2013: 66 · 2012: 54
FWCI
19.75
Type
book chapter
Language
en
Open access
closed
Locations
Mathematical Sciences Research Institute publications (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
  • Physical Sciences › Mathematics › Applied Mathematics › Geometric Analysis and Curvature Flows
  • Physical Sciences › Mathematics › Geometry and Topology › Mathematics and Applications
Keywords
hyperbolic groups, Gromov hyperbolicity, geometric group theory, Cayley graphs, word metric, hyperbolic geometry

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review