Related papers: Geodesic Distance in Planar Graphs
Our aim in this paper is to construct a numerical algorithm using Taylor expansion of exponential map to find geodesic joining two points on a 2-dimensional surface for which a Riemannian metric is defined
We review a simple but instructive application of the formalism of covariant bitensors, to use a deviation vector field along a fiducial geodesic to describe a neighboring worldline, in an exact and manifestly covariant manner, via the…
In order to study the quantum geometry of random surfaces in Liouville gravity, we propose a definition of geodesic distance associated to a Gaussian free field on a regular lattice. This geodesic distance is used to numerically determine…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
We examine the scaling of geodesic correlation functions in two-dimensional gravity and in spin systems coupled to gravity. The numerical data support the scaling hypothesis and indicate that the quantum geometry develops a non-perturbative…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph $G$ is introduced as the task to find a smallest set $S$ of vertices of $G$ such that…
We present a novel way of constructing the Gaussian Free Field on a weighted graph via a dynamical expansion of the Green function along an expanding family of subgraphs. Along the way we obtain the discrete analogue of the classical…
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
The fractal properties of four-dimensional Euclidean simplicial manifold generated by the dynamical triangulation are analyzed on the geodesic distance D between two vertices instead of the usual scale between two simplices. In order to…
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
One of the most animated themes of multidimensional persistence is the comparison between invariants. The matching distance between persistent Betti numbers functions (or rank invariants), is among the most studied metrics in this context,…
A simple observation about the action for geodesics in a stationary spacetime with separable geodesic equations leads to a natural class of slicings of that spacetime whose orthogonal geodesic trajectories represent freely falling…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model, in the supercritical regime. Under the assumption that the covariance between the…
We study the geodesic complexity of the ordered and unordered configuration spaces of graphs in both the $\ell_1$ and $\ell_2$ metrics. We determine the geodesic complexity of the ordered two-point $\varepsilon$-configuration space of any…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all…
The action of the mapping class group of the thrice-punctured projective plane on its $\mathrm{GL}(2,\mathbb{C})$ character variety produces an algorithm for generating the simple length spectra of quasi-Fuchsian thrice-punctured projective…