Related papers: Geodesic Distance in Planar Graphs: An Integrable …
We show that there exists a divergent correlation length in 2d quantum gravity for the matter fields close to the critical point provided one uses the invariant geodesic distance as the measure of distance. The corresponding…
We propose a method for demonstrating equivalences beyond the saddlepoint approximation between quantities in quantum gravity that are defined by the Euclidean path integral, without assumptions about holographic duality. The method…
Over the last two years, the canonical approach to quantum gravity based on connections and triads has been put on a firm mathematical footing through the development and application of a new functional calculus on the space of gauge…
The quadratic embedding constant (QEC) of a graph $G$ is a new numeric invariant, which is defined in terms of the distance matrix and is denoted by $\mathrm{QEC}(G)$. By observing graph structure of the maximal cliques (clique graph), we…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
Classical methods of differential geometry are used to construct equations of motion for particles in quantum, electrodynamic and gravitational fields. For a five dimensional geometrical system, the equivalence principle can be extended.…
For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…
Graphs drawn in the plane are ubiquitous, arising from data sets through a variety of methods ranging from GIS analysis to image classification to shape analysis. A fundamental problem in this type of data is comparison: given a set of such…
We revisit the construction of quantum Riemannian geometries on graphs starting from a hermitian metric compatible connection, which always exists. We use this method to find quantum Levi-Civita connections on the $n$-leg star graph for…
We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the "closeness" between two nodes. The calculation of the measure is linear in the number of edges in the graph and…
We address the "inverse problem" for discrete geometry, which consists in determining whether, given a discrete structure of a type that does not in general imply geometrical information or even a topology, one can associate with it a…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the…
Four-dimensional(4D) spacetime structures are investigated using the concept of the geodesic distance in the simplicial quantum gravity. On the analogy of the loop length distribution in 2D case, the scaling relations of the boundary volume…
We describe an efficient and scalable spherical graph embedding method. The method uses a generalization of the Euclidean stress function for Multi-Dimensional Scaling adapted to spherical space, where geodesic pairwise distances are…