Related papers: The Shortest-Path distance on graphons
Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce "gate graph" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph.…
Let M be a compact Riemannian manifold without boundary and let H be a self-adjoint generalized Laplace operator acting on sections in a bundle over M. We give a path integral formula for the solution to the corresponding heat equation.…
We study the problem of calculating noncommutative distances on graphs, using techniques from linear algebra, specifically, Birkhoff-James orthogonality. A complete characterization of the solutions is obtained in the case when the…
We introduce the heat method for computing the shortest geodesic distance to a specified subset (e.g., point or curve) of a given domain. The heat method is robust, efficient, and simple to implement since it is based on solving a pair of…
In this paper, we present approximate distance and shortest-path oracles for fault-tolerant Euclidean spanners motivated by the routing problem in real-world road networks. An $f$-fault-tolerant Euclidean $t$-spanner for a set $V$ of $n$…
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…
What is the shortest path between two data points lying in a high-dimensional space? While the answer is trivial in Euclidean geometry, it becomes significantly more complex when the data lies on a curved manifold -- requiring a Riemannian…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
This paper prescribes a distance between learning tasks modeled as joint distributions on data and labels. Using tools in information geometry, the distance is defined to be the length of the shortest weight trajectory on a Riemannian…
The Fr\'{e}chet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and walks on an underlying graph (such as a road network),…
We are interested in the general question: to what extent are the spectral properties of a graph connected to the distance function? Our motivation is a concrete example of this question that is due to Steinerberger. We provide some…
We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem. Then we propose a novel distance between two graphs, named…
Combining Varadhan's formula, Loewner's theorem with the method of stationary phase, we study the exact formula of the Carnot-Carath\'eodory distance on $2$-step groups. The method is also adapted to determine all normal geodesics from the…
Finding the shortest path in a graph has applications to a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest path…
An isometric path between two vertices in a graph $G$ is a shortest path joining them. The isometric path number of $G$, denoted by $\ip(G)$, is the minimum number of isometric paths needed to cover all vertices of $G$. In this paper, we…
As large graph datasets become increasingly common across many fields, sampling is often needed to reduce the graphs into manageable sizes. This procedure raises critical questions about representativeness as no sample can capture the…
Many applications in pattern recognition represent patterns as a geometric graph. The geometric graph distance (GGD) has recently been studied as a meaningful measure of similarity between two geometric graphs. Since computing the GGD is…
How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree. The edge set $E$ is initially unknown, and the graph can be…
Given a graph $G$ and a set of terminals $T$, a \emph{distance emulator} of $G$ is another graph $H$ (not necessarily a subgraph of $G$) containing $T$, such that all the pairwise distances in $G$ between vertices of $T$ are preserved in…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…