• Corpus ID: 14720409

The Apple Doesn’t Fall Far From the (Metric) Tree: Equivalence of Definitions

  title={The Apple Doesn’t Fall Far From the (Metric) Tree: Equivalence of Definitions},
  author={Asuman G{\"u}ven Aksoy and Sixian Jin},
  journal={arXiv: Metric Geometry},
In this paper we prove the equivalence of definitions for metric trees and for \delta-hyperbolic spaces. We point out how these equivalences can be used to understand the geometric and metric properties of \delta-hyperbolic spaces and its relation to CAT(\kappa) spaces. 

Figures from this paper

Representation Theorems of R-trees and Brownian Motions Indexed by R-trees

We provide a new representation of an R-tree by using a special set of metric rays. We have captured the four-point condition from these metric rays and shown an equivalence between the R-trees with

Fixed Point Theorems for Operators with Certain Condition in p-Uniformly Convex Metric Spaces

Abstract In this paper, firstly, we extend the nonlinear Lebesgue spaces from the setting of Hadamard spaces to the setting of p-uniformly convex metric spaces. Afterward, we establish some

Representation Theorems of $\mathbb{R}$-trees and Brownian Motions Indexed by $\mathbb R$-trees

This work has captured the four-point condition from these metric rays and shown an equivalence between the $\mathbb R$-trees with radial and river metrics, and these sets of metric rays.

Tropical complexes of submatrices of tree metrics ∗

A zonotope is an affine projection of a hypercube and a zonotopal tiling is a subdivision of a polytope by zonotopes. Given any finite subset S in a tropical projective torus, Develin and Sturmfels

Metric properties of large graphs

A coloring game on graphs is studied as a solution concept for the dynamic of online communities and afine-grained complexity analysis for computing Nash and strong Nash equilibria in this game is given, thereby answering open questions from the literature.

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth

A polynomial-time algorithm is presented that returns an induced cycle larger than k in G, or computes a tree-decomposition of G, each bag of which contains a dominating path with at most k−1 vertices, and it is proved that any k-chordal graph with maximum degree Δ has treewidth at most (k−1)(Δ−1)+2, improving the O(Δ(Γ)k−3) bound.

Origin of Hyperbolicity in Brain-to-Brain Coordination Networks

These topology features are in qualitative agreement with the listener’s self-reported ratings of own experience and quality of the speaker, suggesting that studies of the cross-brain connector networks can reveal new insight into the neural mechanisms underlying human social behavior.

Self-organised criticality and emergent hyperbolic networks: blueprint for complexity in social dynamics

  • B. Tadić
  • Computer Science
    European Journal of Physics
  • 2019
The self-organised criticality as the acting mechanism in the social knowledge-sharing dynamics and the emergence of the hyperbolic geometry of the co-evolving networks that underlie these stochastic processes are described.



Explicit Constructions of Universal R‐Trees and Asymptotic Geometry of Hyperbolic Spaces

This paper presents explicit constructions of universal R‐trees as certain spaces of functions, and also proves that a 2ℵ0 ‐universal R‐tree can be isometrically embedded at infinity into a complete

Tree metrics and their Lipschitz-free spaces

We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of $L_1$.

Embeddings of Gromov Hyperbolic Spaces

It is shown that a Gromov hyperbolic geodesic metric space X with bounded growth at some scale is roughly quasi-isometric to a convex subset of hyperbolic space. If one is allowed to rescale the

Asymptotic upper curvature bounds in coarse geometry

We define a notion of an asymptotic upper curvature bound for Gromov hyperbolic metric spaces that is invariant under rough-isometries and examine the basic properties of this concept.

Interplay between interior and boundary geometry in Gromov hyperbolic spaces

We show that two visual and geodesic Gromov hyperbolic metric spaces are roughly isometric if and only if their boundaries at infinity, equipped with suitable quasimetrics, are

A Selection Theorem in Metric Trees

In this paper, we show that nonempty closed convex subsets of a metric tree enjoy many properties shared by convex subsets of Hilbert spaces and admissible subsets of hyperconvex spaces. Furthermore,

Best Approximation in ℝ-Trees

An ℝ-tree is a geodesic space for which there is a unique arc joining any two of its points, and this arc is a metric segment. We give a constructive proof of the following “best approximation”

Characterization of separable metric R-trees

An R-tree (X, d) is a uniquely arcwise connected metric space in which each arc is isometric to a subarc of the reals. R-trees arise naturally in the study of groups of isometries of hyperbolic