Related papers: Hyperbolic volume estimates via train tracks

Accurate prediction of metro passenger volume (number of passengers) is valuable to realize real-time metro system management, which is a pivotal yet challenging task in intelligent transportation. Due to the complex spatial correlation and…

We prove a theorem describing the limiting fine-scale statistics of orbits of a point in hyperbolic space under the action of a discrete subgroup. Similar results have been proved only in the lattice case, with two recent infinite-volume…

We study hidden boundary trace regularity for two-dimensional hyperbolic equations with boundary degeneracy governed by $\mcA\vp=-\Div(A\nabla \vp)$, where $A=\diag(1,r^\al)$ and $\al\in(0,1)$. We establish well-posedness in weighted…

In this work, we prove a synthetic splitting theorem for globally hyperbolic Lorentzian length spaces with global non-negative timelike curvature containing a complete timelike line. Just like in the case of smooth spacetimes, we construct…

We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…

Given a periodic splitting sequence of a measured train track, an Agol cycle is the part that constitutes a period up to the action of a pseudo-Anosov map and the rescaling by its dilatation. We consider a family of pseudo-Anosov maps on…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

In this paper, we prove the Bounded Height Conjecture which the author formulated in [2]. As a corollary, it follows that there are only a finite number of hyperbolic three manifolds of bounded volume and trace field degree.

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolation (SFP). In HRGs, $n=\Theta(\mathrm{e}^{R/2})$ vertices…

Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a distance between graphs. Our idea is to derive…

We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$. Using a new separator theorem, we show that unit ball graphs in $\mathbb{H}^d$…

The diameter of a graph is one if its most important parameters, being used in many real-word applications. In particular, the diameter dictates how fast information can spread throughout data and communication networks. Thus, it is a…

We give a lower bound for the widths of the collars of certain short partial pants decomposition of the surface. Then we apply this to obtain upper bounds of the renormalized volume of certain Schottky manifolds in terms of the hyperbolic…

We propose a hyperbolic set-to-set distance measure for computing dissimilarity between sets in hyperbolic space. While point-to-point distances in hyperbolic space effectively capture hierarchical relationships between data points, many…

Our goal is to show, in two different contexts, that "random" surfaces have large pants decompositions. First we show that there are hyperbolic surfaces of genus $g$ for which any pants decomposition requires curves of total length at least…

This Part establishes the geometric theory of uniformly hyperbolic sets with explicit quantitative bounds throughout, and contains five main theorems. The Stable Manifold Theorem is proved via the backward graph transform, with a complete…

We obtain high-velocity estimates with error bounds for the scattering operator of the Schr\"odinger equation in three dimensions with electromagnetic potentials in the exterior of bounded obstacles that are handlebodies. A particular case…

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 study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^{\alpha}$,…