相关论文: Hyperbolic volume estimates via train tracks

We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…

Let $\Delta_{L,\rho_n}(t)$ be the twisted Alexander polynomial with respect to the representation given by the composition of the lift of the holonomy representation of a certain hyperbolic link $L$ and the $n$-dimensional irreducible…

We derive a trace formula for the splitting-weighted density of states suitable for chaotic potentials with isolated symmetric wells. This formula is based on complex orbits which tunnel through classically forbidden barriers. The theory is…

We prove that any mapping torus of a pseudo-Anosov mapping class with bounded normalized Weil-Petersson translation length contains a finite set of transverse and level closed curves, and drilling out this set of curves results in one of a…

We introduce a new pattern recognition algorithm for track finding in High Energy Physics Experiments based on an extension of the Hough Transform to multiple dimensions. A remarkable property of this algorithm is that the execution time is…

We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…

It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces. Consequently, many tools of machine learning were extended to such spaces, but only few…

The Fr\'echet distance is a popular distance measure between trajectories or curves in space, or between walks in graphs. We study computing the Fr\'echet distance between walks in the $d$-dimensional grid graphs, i.e. $\mathbb{Z}^d$ where…

We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range $(2,3)$. In particular, we first focus on the expected time for a…

We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…

Thanks to a recent result by Jean-Marc Schlenker, we establish an explicit linear inequality between the normalized entropies of pseudo-Anosov automorphisms and the hyperbolic volumes of their mapping tori. As its corollaries, we give an…

Let (X,d) be a tree (T) of hyperbolic metric spaces satisfying the quasi-isometrically embedded condition. Let $v$ be a vertex of $T$. Let $({X_v},d_v)$ denote the hyperbolic metric space corresponding to $v$. Then $i : X_v \rightarrow X$…

The goal of this article is two-fold: in a first part, we prove Azuma-Hoeffding type concentration inequalities around the drift for the displacement of non-elementary random walks on hyperbolic spaces. For a proper hyperbolic space $M$, we…

In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter…

We prove a radial source estimate in H\"older-Zygmund spaces for uniformly hyperbolic dynamics (also known as Anosov flows), in the spirit of Dyatlov-Zworski. The main consequence is a new linear stability estimate for the marked length…

If a hyperbolic link has a prime alternating diagram D, then we show that the link complement's volume can be estimated directly from D. We define a very elementary invariant of the diagram D, its twist number t(D), and show that the volume…

We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in terms of two diagrammatic quantities: the twist number and the number of certain alternating tangles in an A-adequate diagram. We then…

A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does not contain arcs inside each partition element, and the arcs…

We present the mathematical basis of a new approach to the analysis of temporal coding. The foundation of the approach is the construction of several families of novel distances (metrics) between neuronal impulse trains. In contrast to most…

One of our main goals in this paper is to understand the behavior of limit sets of a diverging sequence of Schottky groups in the group of isometries of the N-dimensional hyperbolic space. This leads us to a generalization of a classical…