相关论文: Hyperbolic volume estimates via train tracks

We introduce a notion of the twist of an isometry of the hyperbolic plane. This twist function is defined on the universal covering group of orientation-preserving isometries of the hyperbolic plane, at each point in the plane. We relate…

Thanks to a theorem of Brock on comparison of Weil-Petersson translation distances and hyperbolic volumes of mapping tori for pseudo-Anosovs, we prove that the entropy of a surface automorphism in general has linear bounds in terms of…

We study coarse separation in one-ended hyperbolic groups from a quantitative point of view, focusing on the volume growth of separating subsets. We prove that a one-ended hyperbolic group that is not virtually a surface group is coarsely…

For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…

Hyperbolic space is a geometry that is known to be well-suited for representation learning of data with an underlying hierarchical structure. In this paper, we present a novel hyperbolic distribution called \textit{pseudo-hyperbolic…

Graph-structured data are widespread in real-world applications, such as social networks, recommender systems, knowledge graphs, chemical molecules etc. Despite the success of Euclidean space for graph-related learning tasks, its ability to…

This paper presents a mathematical model for the train dynamics in a mass-transit metro line system with one symmetrically operated junction. We distinguish three parts: a central part and two branches. The tracks are spatially discretized…

This article explores the required amount of time series points from a high-speed traffic network to accurately estimate the Hurst exponent. The methodology consists in designing an experiment using estimators that are applied to time…

In this paper, we prove a combination theorem for a relatively acylindrical graph of relatively hyperbolic groups (Theorem 1.1). Here, we are extending the technique of [Tom21] and constructing Bowditch boundary of the fundamental group of…

We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We investigate optimality principles exhibited by these solutions from the point of view of…

Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…

The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence…

We introduce a number of tools for finding and studying \emph{hierarchically hyperbolic spaces (HHS)}, a rich class of spaces including mapping class groups of surfaces, Teichm\"{u}ller space with either the Teichm\"{u}ller or…

We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…

Learning in hyperbolic spaces has attracted increasing attention due to its superior ability to model hierarchical structures of data. Most existing hyperbolic learning methods use fixed distance measures for all data, assuming a uniform…

An important conjecture in knot theory relates the large-$N$, double scaling limit of the colored Jones polynomial $J_{K,N}(q)$ of a knot $K$ to the hyperbolic volume of the knot complement, $\text{Vol}(K)$. A less studied question is…

Scene graph representations enable structured visual understanding by modeling objects and their relationships, and have been widely used for multiview and 3D scene reasoning. Existing methods such as MSG learn scene graph embeddings in…

In this paper we give a characterization of the Gromov hyperbolicity of trains (a large class of Denjoy domains which contains the flute surfaces) in terms of the behavior of a real function. This function describes somehow the distances…

In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…

We have studied a chaotic transport in a two-dimensional periodic vortical flow under a time-dependent perturbation with period T where the global diffusion occurs along the stochastic web. By using the Melnikov method we construct the…