Related papers: A tree bijection for cusp-less planar hyperbolic s…

The Wasserstein distance quantifies the distance between two probability measures on a metric space. We prove an analogue of the Berry-Esseen inequality for the Wasserstein distance on a finite area hyperbolic surface. This inequality…

In this article, we prove that typical hyperbolic surfaces, sampled with the Weil-Petersson probability measure, have a spectral gap at least $2/9 - \epsilon$. This is an intermediate result on the way to our proof of the optimal spectral…

A decision tree is commonly restricted to use a single hyperplane to split the covariate space at each of its internal nodes. It often requires a large number of nodes to achieve high accuracy, hurting its interpretability. In this paper,…

Finding meaningful distances between high-dimensional data samples is an important scientific task. To this end, we propose a new tree-Wasserstein distance (TWD) for high-dimensional data with two key aspects. First, our TWD is specifically…

We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…

Tree-Sliced methods have recently emerged as an alternative to the traditional Sliced Wasserstein (SW) distance, replacing one-dimensional lines with tree-based metric spaces and incorporating a splitting mechanism for projecting measures.…

For X = R, C, or H it is well known that cusp cross-sections of finite volume X-hyperbolic (n+1)-orbifolds are flat n-orbifolds or almost flat orbifolds modelled on the (2n+1)-dimensional Heisenberg group N_{2n+1} or the (4n+3)-dimensional…

Given data, finding a faithful low-dimensional hyperbolic embedding of the data is a key method by which we can extract hierarchical information or learn representative geometric features of the data. In this paper, we explore a new method…

In this paper, we study bijections on strictly convex sets of $\mathbf R \mathbf P^n$ for $n \geq 2$ and closed convex projective surfaces equipped with the Hilbert metric that map complete geodesics to complete geodesics as sets.…

Given two hyperbolic surfaces and a homotopy class of maps between them, Thurston proved that there always exists a representative minimizing the Lipschitz constant. While not unique, these minimizers are rigid along a geodesic lamination.…

In machine learning, data is usually represented in a (flat) Euclidean space where distances between points are along straight lines. Researchers have recently considered more exotic (non-Euclidean) Riemannian manifolds such as hyperbolic…

We study the geometry and spectral theory of Weil-Petersson random surfaces with genus-$g$ and $n$ cusps in the large-$n$ limit. We show that for a random hyperbolic surface in $\mathcal{M}_{g,n}$ with $n$ large, the number of small…

Moduli spaces of hyperbolic surfaces with geodesic boundary components of fixed lengths may be endowed with a symplectic structure via the Weil-Petersson form. We show that, as the boundary lengths are sent to infinity, the Weil-Petersson…

Recent literature on Weil-Petersson random hyperbolic surfaces has met a consistent obstacle: the necessity to condition the model, prohibiting certain rare geometric patterns (which we call tangles), such as short closed geodesics or…

We prove Poisson approximation results for the bottom part of the length spectrum of a random closed hyperbolic surface of large genus. Here, a random hyperbolic surface is a surface picked at random using the Weil-Petersson volume form on…

Analyzing and identifying the shortcomings of current subdivision methods for finding intersections of rays with fibers defined by the surface of a circular contour swept along a B\'ezier curve, we present a new algorithm that improves…

For compact Riemann surfaces, the collar theorem and Bers' partition theorem are major tools for working with simple closed geodesics. The main goal of this paper is to prove similar theorems for hyperbolic cone-surfaces. Hyperbolic…

Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider…

Cooper and Long generalised Epstein and Penner's Euclidean cell decomposition of cusped hyperbolic manifolds of finite volume to non-compact strictly convex projective manifolds of finite volume. We show that Weeks' algorithm to compute…

Geodesic regular tree structures are essential to combat numerical precision issues that arise while working with large-scale computational hyperbolic geometry and have applications in algorithms based on distances in such tessellations. We…