Related papers: Minimizing geodesic nets and critical points of di…

We consider the minimal number of points on a regular grid on the plane that generates $n$ line segments of points of exactly length $k$. We illustrate how this is related to the $n$-queens problem on the toroidal chessboard and show that…

We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…

Due to its rapid development in the past decade, air transportation system has attracted considerable research attention from diverse communities. While most of the previous studies focused on airline networks, here we systematically…

Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine…

We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving constant bounded distortions. The model builds networks with both number of vertices and size…

The directed landscape is a random directed metric on the plane that arises as the scaling limit of classical metric models in the KPZ universality class. Typical pairs of points in the directed landscape are connected by a unique geodesic.…

For a graph $G$, and two distinct vertices $u$ and $v$ of $G$, let $n_G(u,v)$ be the number of vertices of $G$ that are closer in $G$ to $u$ than to $v$. Miklavi\v{c} and \v{S}parl (arXiv:2011.01635v1) define the distance-unbalancedness of…

A Riemannian or Finsler metric on a compact manifold M gives rise to a length function on the free loop space \Lambda M, whose critical points are the closed geodesics in the given metric. If X is a homology class on \Lambda M, the minimax…

We construct a geodesic net in the plane with four unbalanced (boundary) vertices that has 16 balanced vertices and does not contain proper geodesic subnets. This is the first example of an irreducible geodesic net in the Euclidean plane…

We observe that a vanishing geodesic distance arising from a weak Riemannian metric in a Hilbert manifold can be constructed.

We define a new measure of network symmetry that is capable of capturing approximate global symmetries of networks. We apply this measure to different networks sampled from several classic network models, as well as several real-world…

Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…

This paper presents a survey of recent and not so recent results concerning the study of smooth homeomorphisms of the circle with a finite number of non-flat critical points, an important topic in the area of One-dimensional Dynamics. We…

We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field. Homology groups of such a…

In this paper, we propose a generalized notion of a distance function, called a $g$-metric. The $g$-metric with degree $n$ is a distance of $n+1$ points, generalizing the ordinary distance between two points and $G$-metric between three…

Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths…

This paper prescribes a distance between learning tasks modeled as joint distributions on data and labels. Using tools in information geometry, the distance is defined to be the length of the shortest weight trajectory on a Riemannian…

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…

Foucaud, Krishna and Lekshmi recently introduced the concept of monitoring edge-geodetic sets in graphs, and a related graph invariant. These are sets of vertices such that the removal of any edge changes the distance between some pair of…

A well-known Lemma in Riemannian geometry by Klingenberg says that if $x_0$ is a minimum point of the distance function $d(p,\cdot)$ to $p$ in the cut locus $C_p$ of $p$, then either there is a minimal geodesic from $p$ to $x_0$ along which…