Related papers: Almost quasi-isometries and more non-exact groups

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

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 show that Gromov's monsters arising from i.i.d. random labellings of expanders (that we call random Gromov's monsters) have linear divergence along a subsequence, so that in particular they do not contain Morse quasigeodesics, and they…

The quasi-redirecting (QR) boundary, introduced by Qing and Rafi, generalizes the Gromov boundary for studying the large-scale geometry of finitely generated groups. Although it is not known to exist for all such groups, its existence has…

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

Extended admissible groups belong to a particular class of graphs of groups that admit a decomposition generalizing those of non-geometric 3-manifold groups and Croke-Kleiner admissible groups. In this paper, we study several…

We prove extension theorems for several geometric properties such as asymptotic property C (APC), finite decomposition complexity (FDC), strict finite decomposition complexity (sFDC) which are weakenings of Gromov's finite asymptotic…

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…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…

Gromov (2003) constructed finitely generated groups whose Cayley graphs contain all graphs from a given infinite sequence of expander graphs of unbounded girth and bounded diameter-to-girth ratio. These so-called Gromov monster groups…

We construct p.m.p. group actions that are not local-global limits of sequences of finite graphs. Moreover, they do not weakly contain any sequence of finite labeled graphs. Our methods are based on the study of almost automorphisms of…

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes…

We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let $G$ be a group that is one-ended, hyperbolic relative to…

Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…

A result due to M. Gromov states that any two finitely generated groups {\Gamma} and {\Lambda} are quasi-isometric if and only if they admit a topological coupling, i.e., a commuting pair of proper continuous cocompact actions…

Let F be the free group over a set of two or more generators. R. Brooks constructed an infinite family of quasi-morphisms on F such that an infinite subfamily gives rise to independent classes in the second bounded cohomology of F, which…

Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…