Related papers: Tree amalgamations and quasi-isometries
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
We give necessary and sufficient conditions under which a quasi-action of any group on an arbitrary metric space can be reduced to a cobounded isometric action on some bounded valence tree, following a result of Mosher, Sageev and Whyte.…
This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…
We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…
A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
For a one-ended right-angled Artin group, we give an explicit description of its JSJ tree of cylinders over infinite cyclic subgroups in terms of its defining graph. This is then used to classify certain right-angled Artin groups up to…
We study the construction of quasimorphisms on groups acting on trees introduced by Monod and Shalom, that we call median quasimorphisms, and in particular we fully characterise actions on trees that give rise to non-trivial median…
We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
Closed subgroups of the group of isometries of the regular tree $\treeq$ that fix an end of the tree and are vertex-transitive are shown to correspond, on one hand, to self-replicating groups acting on rooted trees and, on the other hand,…
The present paper studies the structure of characteristic varieties of fundamental groups of graph manifolds. As a consequence, a simple proof of Papadima's question is provided on the characterization of algebraic links that have…
We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman's random interlacement…