Related papers: Tree approximation in quasi-trees

In this paper we provide two new constructions that are useful for the theory of projection complexes developed by Bestvina, Bromberg, Fujiwara and Sisto. We prove that there exists a subtree of the projection complex which is…

We develop a battery of tools for studying quasi-isometric rigidity and classification problems for splittings of groups. The techniques work best for finite graphs of groups where all edge and vertex groups are coarse PD groups. For…

We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…

We define a distance analogous to the Gromov-Hausdorff distance that enables the comparison of arbitrary quasi-isometric spaces. We also investigate properties preserved under limits with respect to this distance, as well as properties of…

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…

We develop the foundations of a geometric theory of countably-infinite approximate groups, extending work of Bj\"orklund and the second-named author. Our theory is based on the notion of a quasi-isometric quasi-action (qiqac) of an…

We look at tree amalgamations of locally finite quasi-transitive hyperbolic graphs and prove that the homeomorphism type of the hyperbolic boundary of such a tree amalgamation only depends on the homeomorphism types of the hyperbolic…

A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not…

We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…

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…

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

We introduce a relaxed version of the metric definition of quasiconformality that is natural also for mappings of low regularity, including $W_{\mathrm{loc}}^{1,1}(\mathbb{R}^n;\mathbb{R}^n)$-mappings. Then we show on the plane that this…

We define the concept of an ultrametric M\"obius space and use this to characterize nonelementary geodesically complete trees.

We give exact values and bounds on the isoperimetric peak of complete trees, improving on known results. For the complete $q$-ary tree of depth $d$, if $q\ge 5$, then we find that the isoperimetric peak equals $d$, completing an open…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

It is well-known that a Kleinian group is amenable if and only if it is elementary. We establish an analogous property for equivalence relations and foliations with Gromov hyperbolic leaves: they are amenable if and only if they are…

Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of…