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

We explore a connection between geodesic nets and quantum graphs optimising certain functionals from spectral theory. For surfaces, critical metrics for the normalised $k^{\mathrm{th}}$ eigenvalue of the Laplacian give rise to isometric…

What one obtains when the min-max methods for the distance function are applied on the space of pairs of points of a Riemannian two-sphere? This question is studied in details in the present article. We show that the associated min-max…

Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices…

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/k$. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of…

We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…

Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…

We study the level sets of the distance function from a boundary point of a convex set in Euclidean space. We provide a lower bound for the range of connectivity of the level sets, in terms of the critical points of the distance function in…

We find an upper bound for geodesic distances associated to monotone Riemannian metrics on positive definite matrices and density matrices.

Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean…

A key task in the study of networked systems is to derive local and global properties that impact connectivity, synchronizability, and robustness; computing shortest paths or geodesics yields measures of network connectivity that can…

We compute the minimum number of critical points of a small codimension smooth map between two manifolds. We give as well some partial results for the case of higher codimension when the manifolds are spheres.

We endow the set of probability measures on a weighted graph with a Monge--Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have $n$ vertices and so, the boundary of the probability simplex…

In this paper we show that on a complete Riemannian manifold of negative curvature and dimension $n>1$ every two points which realize a local maximum for the distance function are connected by at least $2n+1$ geometrically distinct geodesic…

Geodesic nets are types of graphs in Riemannian manifolds where each edge is a geodesic segment. One important object used in the construction of geodesic nets is a balanced vertex, where the sum of unit tangent vectors along adjacent edges…

This paper focuses on the problem of topological equivalence of functions with isolated critical points on the boundary of a compact surface $M$ which are also isolated critical points of their restrictions to the boundary. This class of…

We construct a geodesic net in the plane with four boundary (unbalanced) vertices that has 25 balanced vertices and that is irreducible, i.e. it does not contain nontrivial subnets. This net is novel and remarkable for several reasons: (1)…

Let x and y be two (not necessarily distinct) points on a closed Riemannian manifold M of dimension n. According to a celebrated theorem by J.P. Serre there exist infinitely many geodesics between x and y. The length of the shortest of…

We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…

A minimal geodesic on a Riemannian manifold is a geodesic defined on $\mathbb{R}$ that lifts to a globally distance minimizing curve on the universal covering. Bangert proved that there is a lower bound for the number of geometrically…

We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be…