Related papers: Geodesic Distance in Planar Graphs
In the dynamical triangulation model of 4D euclidean quantum gravity we measure two-point functions of the scalar curvature as a function of the geodesic distance. To get the correlations it turns out that we need to subtract a squared…
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a…
Suppose that the surfaces K0 and Kr are the boundaries of two convex, complete, connected C^2 bodies in R^3. Assume further that the (Euclidean) distance between any point x in Kr and K0 is always r (r > 0). For x in Kr, let {\Pi}(x) denote…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We study geodesics in the Brownian map $(\mathcal{S},d,\nu)$, the random metric measure space which arises as the Gromov-Hausdorff scaling limit of uniformly random planar maps. Our results apply to all geodesics including those between…
In first-passage percolation (FPP), one places nonnegative random variables (weights) $(t_e)$ on the edges of a graph and studies the induced weighted graph metric. We consider FPP on $\mathbb{Z}^d$ for $d \geq 2$ and analyze the geometric…
We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…
The concept of derivative coordinate functions proved useful in the formulation of analytic fractal functions to represent smooth symmetric binary fractal trees [1]. In this paper we introduce a new geometry that defines the fractal space…
We discuss how concepts such as geodesic length and the volume of space-time can appear in 2d topological gravity. We then construct a detailed mapping between the reduced Hermitian matrix model and 2d topological gravity at genus zero.…
Given any arbitrary semi-algebraic set $X$, any two points in $X$ may be joined by a piecewise $C^2$ path $\gamma$ of shortest length. Suppose $\mathcal{A}$ is a semi-algebraic stratification of $X$ such that each component of $\gamma \cap…
We compute correlation functions, specifically 1-point and 2-point functions, in holographic boundary conformal field theory (BCFT) using geodesic approximation. The holographic model consists of a massive scalar field coupled to a…
This paper is a review on recently found connection between geodesically equivalent metrics and integrable geodesic flows. Suppose two different metrics on one manifold have the same geodesics. We show that then the geodesic flows of these…
Equations of the Loewner class subject to non-constant boundary conditions along the real axis, are formulated and solved giving the geodesic paths of slits growing in the upper half complex plane. The problem is motivated by Laplacian…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
A stochastic model relating the parameters of astrophysical structures to the parameters of their granular components is applied to the formation of hierarchical, large-scale structures from galaxies assumed as point-like objects. If the…
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…
We study first-passage percolation through related optimization problems over paths of restricted length. The path length variable is in duality with a shift of the weights. This puts into a convex duality framework old observations about…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Having no effective formulas to compute the distance of a point and a set, it is hard to…
Ratner's theorem implies topological rigidity of immersed totally geodesic subspaces of noncompact type in finite-volume locally symmetric spaces. In higher rank and infinite volume, however, counter-examples to this rigidity have remained…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…