相关论文: Geodesic Distance in Planar Graphs: An Integrable …
We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…
We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…
Geodesic distances on manifolds have numerous applications in image processing, computer graphics and computer vision. In this work, we introduce an approach called `LGGD' (Learned Generalized Geodesic Distances). This method involves…
In analogy with the well-known 2-linkage tractor-trailer problem, we define a 2-linkage problem in the plane with novel non-holonomic ``no-slip'' conditions. Using constructs from sub-Riemannian geometry, we look for geodesics corresponding…
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…
This paper describes a new approach to the problem of the structural research of clusters based on the theory of geodetic and k-geodetic graphs. We firmly believe that this same approach can be used when solving problems of correlation…
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…
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…
We study a proposal for gauge-invariant correlation functions in perturbative quantum gravity, which are obtained by fixing the geodesic distance between points in the fluctuating geometry. These correlation functions are non-local and…
We consider the large-$D$ limit of Einstein gravity. It is observed that a consistent leading large-$D$ graph limit exists, and that it is built up by a subclass of planar diagrams. The graphs in the effective field theory extension of…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it…
We describe, in an intrinsic way and using the global chart provided by Ito's parallel transport, a generalisation of the notion of geodesic (as critical path of an energy functional) to diffusion processes on Riemannian manifolds. These…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a…
We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…
Distance measures provide the foundation for many popular algorithms in Machine Learning and Pattern Recognition. Different notions of distance can be used depending on the types of the data the algorithm is working on. For graph-shaped…
The main results for the two-dimensional quantum gravity, conjectured from the matrix model or integrable approach, are presented in the form to be compared with the world-sheet or Liouville approach. In spherical limit the integrable side…