Pith. sign in

REVIEW 1 cited by

Tree approximation in quasi-trees

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.10741 v4 pith:XM4MS2J3 submitted 2020-12-19 math.MG math.GT

classification math.MGmath.GT
keywords treeapproximationboundaryquasi-treesconsequenceequivalentgivemetric
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree is $(1,C)$-quasi-isometric to a simplicial tree. As a consequence, we show that Gromov's tree approximation lemma for hyperbolic spaces can be improved in the case of quasi-trees to give a uniform approximation for any set of points, independent of cardinality. From this we show that having uniform tree approximation for finite subsets is equivalent to being able to uniformly approximate the entire space by a tree. As another consequence, we note that the boundary of a quasi-tree is isometric to the boundary of its approximating tree under a certain choice of visual metric, and that this gives a natural extension of the standard metric on the boundary of a tree.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph parameters that are coarsely equivalent to tree-length

    math.CO 2025-02 accept novelty 6.0 of 10

    Tree-length is within constant factors of bramble interception radius, Helly-family interception radius, same-vertex-set additive tree distortion, and two new cycle bridging parameters.

Pith tools