Related papers: Disintegrating the curve complex

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

The \emph{graph of irreducible parabolic subgroups} is a combinatorial object associated to an Artin-Tits group $A$ defined so as to coincide with the curve graph of the $(n+1)$-times punctured disk when $A$ is Artin's braid group on…

Tackling semi-supervised learning problems with graph-based methods has become a trend in recent years since graphs can represent all kinds of data and provide a suitable framework for studying continuum limits, e.g., of differential…

We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…

Let $X$ be a geodesic metric space with $H_1(X)$ uniformly generated. If $X$ has asymptotic dimension one then $X$ is quasi-isometric to an unbounded tree. As a corollary, we show that the asymptotic dimension of the curve graph of a…

We study the asymptotic behavior of the asymptotic translation lengths on the curve complexes of pseudo-Anosov monodromies in a fibered cone of a fibered hyperbolic 3-manifold $M$ with $b_1(M) \geq 2$. For a sequence $(\Sigma_n, \psi_n)$ of…

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

We propose the study of Markov chains on groups as a "quasi-isometry invariant" theory that encompasses random walks. In particular, we focus on certain classes of groups acting on hyperbolic spaces including (non-elementary) hyperbolic and…

Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every…

In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…

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…

In this paper we study certain groups of bilipschitz maps of the boundary minus a point of a negatively curved space that is an abelian-by-cyclic solvable Lie group, where the extension is given by a matrix whose eigenvalues all lie outside…

Masur and Minsky showed that the curve graph is quasi-isometric to the Teichm\"uller space electrified along its thin part, and hence the Teichm\"uller space is weakly relatively hyperbolic with respect to the thin part. In this paper, we…

Let $k$ be a number field, and let $S$ be a finite set of maximal ideals of the ring of integers of $k$. In his 1962 ICM address, Shafarevich asked if there are only finitely many $k$-isomorphism classes of algebraic curves of a fixed genus…

Large-scale sublinearly Lipschitz maps have been introduced by Yves Cornulier in order to precisely state his theorems about asymptotic cones of Lie groups. In particular, Sublinearly biLipschitz Equivalences (SBE) are a weak variant of…

In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…

In the framework of homological characterizations of relative hyperbolicity, Groves and Manning posed the question of whether a simply connected $2$-complex $X$ with a linear homological isoperimetric inequality, a bound on the length of…

We prove that the linearly controlled asymptotic dimension of the fundamental group of any 3-dimensional graph-manifold does not exceed 7. As applications we obtain that the universal cover of such a graph-manifold is an absolute Lipschitz…

We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…

Steinerberger defined a notion of boundary for a graph and established a corresponding isoperimetric inquality. Hence, "large" graphs have more boundary vertices. In this paper, we first characterize graphs with three boundary vertices in…