Related papers: Shortest paths in planar domains with hyperbolic t…
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does…
A fundamental result of thermodynamic geometry is that the optimal, minimal-work protocol that drives a nonequilibrium system between two thermodynamic states in the slow-driving limit is given by a geodesic of the friction tensor, a…
We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…
We construct the hyperbolic plane with its geodesic flow as the scale plus symmetry reduction of a three-body problem in the Euclidean plane. The potential is $-I/\Delta^2$ where $I$ is the triangle's moment of inertia and $\Delta$ its…
Mode connectivity is a phenomenon where trained models are connected by a path of low loss. We reframe this in the context of Information Geometry, where neural networks are studied as spaces of parameterized distributions with curved…
We study the conformal capacity by using novel computational algorithms based on implementations of the fast multipole method, and analytic techniques. Especially, we apply domain functionals to study the capacities of condensers $(G,E)$…
Cutting a hyperbolic surface X along a simple closed multi-geodesic results in a hyperbolic structure on the complementary subsurface. We study the distribution of the shapes of these subsurfaces in moduli space as boundary lengths go to…
In this paper, we establish the local superlinear convergence property of some polynomial-time interior-point methods for an important family of conic optimization problems. The main structural property used in our analysis is the…
Given a hyperbolic domain, the nearest point retraction is a conformally natural homotopy equivalence from the domain to the boundary of the convex core of its complement. Marden and Markovic showed that if the domain is uniformly perfect,…
Given a directed graph of nodes and edges connecting them, a common problem is to find the shortest path between any two nodes. Here we show that the shortest path distances can be found by a simple matrix inversion: If the edges are given…
We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. A complex network model gaining considerable popularity builds random…
We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific…
Given a geometric domain $P$, visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within $P$ in order to be able to see a portion (or all) of $P$, while optimizing objectives, such as the…
Let $D\subsetneq\mathbb{R}^n,~n\ge 2$, be a domain. In this manuscript, a new version of the Vuorinen's distance ratio metric $j_D$ [{\tt J. Analyse Math.} {\bf 45} (1985), 69--115], denoted by $\zeta_D$, and a version of Gehring-Osgood's…
The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…
Let $M$ be a compact hyperbolic $3$-manifold with volume $V$. Let $L$ be a link such that $M\setminus L$ is hyperbolic. For any hyperbolic link $L$ in $M$, in this article, we try to establish an upper bound of the length of $n^{th}$…
We show that both Teichmuller space (with the Teichmuller metric) and the mapping class group (with a word metric) have geodesic divergence that is intermediate between the linear rate of flat spaces and the exponential rate of hyperbolic…
We consider the problem of computing shortest paths in weighted unit-disk graphs in constant dimension $d$. Although the single-source and all-pairs variants of this problem are well-studied in the plane case, no non-trivial exact distance…
Shortest path algorithms have played a key role in the past century, paving the way for modern day GPS systems to find optimal routes along static systems in fractions of a second. One application of these algorithms includes optimizing the…