Related papers: Geodesic Distance in Planar Graphs
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 prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…
Consider finitely many points in a geodesic space. If the distance of two points is less than a fixed threshold, then we regard these two points as "near". Connecting near points with edges, we obtain a simple graph on the points, which is…
Given a smooth compact surface without focal points and of higher genus, it is shown that its geodesic flow is semi-conjugate to a continuous expansive flow with a local product structure such that the semi-conjugation preserves…
In this article we study the induced geodesic distance of fractional order Sobolev metrics on the groups of (volume preserving) diffeomorphisms and symplectomorphisms. The interest in these geometries is fueled by the observation that they…
Working bi-Hamiltonian structure and Jacobi identity in Frenet-Serret frame associated to a dynamical system, we proved that all dynamical systems in three dimensions possess two compatible Poisson structures. We investigate relations…
In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour,…
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…
We study correlation functions of scalar operators on the boundary of the $AdS_3$ space deformed by moving massive particles in the context of the AdS/CFT duality. To calculate two-point correlation functions we use the geodesic…
The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in…
We define the notion of near geodesic between points of a metric space when no geodesic exists, and use this to extend Recio-Mitter's notion of geodesic complexity to non-geodesic spaces. This has potential application to topological…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
We introduce the F-adjoined Gauss map. We use it to express the Gaussian maximum likelihood degree as a product of two invariants. As an application of our product formula, we classify all projective curves of Gaussian maximum likelihood…
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 consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…
We study in detail the equations of the geodesic deviation in multidimensional theories of Kaluza-Klein type. We show that their 4-dimensional space-time projections are identical with the equations obtained by direct variation of the usual…
A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…