Related papers: Average Gromov hyperbolicity and the Parisi ansatz
In this paper we explore the idea that Teichm\"uller space is hyperbolic "on average." Our approach focuses on studying the geometry of geodesics which spend a definite proportion of time in some thick part of Teichm\"uller space. We…
We define a norm on the homology of a foliated manifold, which refines and majorizes the usual Gromov norm on homology. This norm depends in an upper semi-continuous way on the underlying foliation, in the geometric topology, and can…
Gromov-Wasserstein (GW) is a powerful tool to compare probability measures whose supports are in different metric spaces. GW suffers however from a computational drawback since it requires to solve a complex non-convex quadratic program. We…
In this paper we study the global geometry of the Kobayashi metric on "convex" sets. We provide new examples of non-Gromov hyperbolic domains in $\mathbb{C}^n$ of many kinds: pseudoconvex and non-pseudocon \newline -vex, bounded and…
The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from…
We introduce the quasi-hyperbolicity constant of a metric space, a rough isometry invariant that measures how a metric space deviates from being Gromov hyperbolic. This number, for unbounded spaces, lies in the closed interval $[1,2]$. The…
In this essay, we discuss the notion of optimal transport on geodesic measure spaces and the associated (2-)Wasserstein distance. We then examine displacement convexity of the entropy functional on the space of probability measures. In…
An ultrametric topology formalizes the notion of hierarchical structure. An ultrametric embedding, referred to here as ultrametricity, is implied by a natural hierarchical embedding. Such hierarchical structure can be global in the data…
In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…
Within a mathematically rigorous model, we analyse the curse of dimensionality for deterministic exact similarity search in the context of popular indexing schemes: metric trees. The datasets $X$ are sampled randomly from a domain $\Omega$,…
In this paper, we investigate Gromov hyperbolizations of unbounded locally complete and incomplete metric spaces associated with three hyperbolic type metrics: the hyperbolization metric introduced by Ibragimov, the distance ratio metric,…
By Gromov's compactness theorem for metric spaces, every uniformly compact sequence of metric spaces admits an isometric embedding into a common compact metric space in which a subsequence converges with respect to the Hausdorff distance.…
Gromov-Hausdorff (GH) distance is a natural way to measure the distortion between two metric spaces. However, there has been only limited algorithmic development to compute or approximate this distance. We focus on computing the…
Many graph processing algorithms require determination of shortest-path distances between arbitrary numbers of node pairs. Since computation of exact distances between all node-pairs of a large graph, e.g., 10M nodes and up, is…
An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…
We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grassmannian. The…
Words are not created equal. In fact, they form an aristocratic graph with a latent hierarchical structure that the next generation of unsupervised learned word embeddings should reveal. In this paper, justified by the notion of…
The well known bunkbed conjecture about percolation on finite graphs is now resolved; Gladkov, Pak and Zimin, building upon work of Hollom, have constructed a counterexample. We revisit this conjecture and study it in the broader context of…
In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…
We introduce the concept of boundary rigidity for Gromov hyperbolic spaces. We show that a proper geodesic Gromov hyperbolic space with a pole is boundary rigid if and only if its Gromov boundary is uniformly perfect. As an application, we…