Related papers: Stable Lengths on the pants graph are rational

We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…

Tight geodesics were introduced by Masur-Minsky in [17]. They and their hierarchies have been a powerful tool in the study of the curve complex, mapping class groups, Teichm\"uller spaces, and hyperbolic 3-manifolds. In the same paper, they…

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

This expository article discusses some connections between the geometry of a hyperbolic 3-manifold homotopy-equivalent to a surface, and the combinatorial properties of its end invariants. In particular a necessary and sufficient condition…

Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…

We prove a central limit theorem for the length of closed geodesics in any compact orientable hyperbolic surface. In the special case of a hyperbolic pair of pants, this settles a conjecture of Chas-Li-Maskit.

We endow the set of probability measures on a weighted graph with a Monge--Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have $n$ vertices and so, the boundary of the probability simplex…

The Brownian map is a random geodesic metric space arising as the scaling limit of random planar maps. We strengthen the so-called confluence of geodesics phenomenon observed at the root of the map, and with this, reveal several properties…

We give a proof of the Gromov compactness theorem using the language of stable curves (i.e. cusp-curve of Gromov, or stable maps of Kontsevich and Manin) in general setting: An almost complex structure on a target manifold is only…

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

We construct explicit examples of geodesics in the mapping class group and show that the shadow of a geodesic in mapping class group to the curve graph does not have to be a quasi-geodesic. We also show that the quasi-axis of a…

We use ending laminations for Weil-Petersson geodesics to establish that bounded geometry is equivalent to bounded combinatorics for Weil-Petersson geodesic segments, rays, and lines. Further, a more general notion of non-annular bounded…

The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…

We analyze the coarse geometry of the Weil-Petersson metric on Teichm\"uller space, focusing on applications to its synthetic geometry (in particular the behavior of geodesics). We settle the question of the strong relative hyperbolicity of…

Divergence functions of a metric space estimate the length of a path connecting two points $A$, $B$ at distance $\le n$ avoiding a large enough ball around a third point $C$. We characterize groups with non-linear divergence functions as…

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…