Related papers: Super efficiency of efficient geodesics in the com…
Let $\mathcal{M}_g$ be the moduli space of hyperbolic surfaces of genus $g$ endowed with the Weil-Petersson metric. In this paper, we show that for any $\epsilon>0$, as $g\to \infty$, for a generic surface in $\mathcal{M}_g$, the error term…
Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ or a shortest path between $w$ and $v$ containing $u$. A vertex set $R$ is a strong…
Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show…
We show that, on a complete and possibly non-compact Riemannian manifold of dimension at least 2 without close conjugate points at infinity, the existence of a closed geodesic with local homology in maximal degree and maximal index growth…
A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,v\in V(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for…
The theory of geodesic regression aims to find a geodesic curve which is an optimal fit to a given set of data. In this article we restrict ourselves to the Riemannian manifold of positive definite operators (matrices) on a Hilbert space of…
A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If $G$ is a graph, then ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that one can assign a fixed geodesic to…
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v in V, there is…
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…
A set of vertices $X$ of a graph $G$ is a strong edge geodetic set if to any pair of vertices from $X$ we can assign one (or zero) shortest path between them such that every edge of $G$ is contained in at least one on these paths. The…
We show that a differentiable function on the 2-Wasserstein space is geodesically convex if and only if it is also convex along a larger class of curves which we call `acceleration-free'. In particular, the set of acceleration-free curves…
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…
Wasserstein distance (WD) and the associated optimal transport plan have been proven useful in many applications where probability measures are at stake. In this paper, we propose a new proxy of the squared WD, coined min-SWGG, that is…
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…
The symmetrized bidisc \[ G \stackrel{\rm{def}}{=}\{(z+w,zw):|z|<1,\ |w|<1\}, \] under the Carath\'eodory metric, is a complex Finsler space of cohomogeneity $1$ in which the geodesics, both real and complex, enjoy a rich geometry. As a…
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…
Large scale-free graphs are famously difficult to process efficiently: the skewed vertex degree distribution makes it difficult to obtain balanced partitioning. Our research instead aims to turn this into an advantage by partitioning the…
In the recent paper \cite{LoD1}, we classified closed geodesics on Finsler manifolds into rational and irrational two families, and gave a complete understanding on the index growth properties of iterates of rational closed geodesics. This…
We investigate typical behavior of geodesics on a closed flat surface $S$ of genus $g\geq 2$. We compare the length quotient of long arcs in the same homotopy class with fixed endpoints for the flat and the hyperbolic metric in the same…
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…