Related papers: Minimizing geodesic nets and critical points of di…
In this note we reduce the problem of geodesic connectedness in a wide class of G\"odel type spacetimes to the search of critical points of a functional naturally involved in the study of geodesics in standard static spacetimes. Then, by…
A geodesic is the shortest path between two vertices in a connected network. The geodesic is the kernel of various network metrics including radius, diameter, eccentricity, closeness, and betweenness. These metrics are the foundation of…
Using an estimate on the number of critical points for a Morse-even function on the sphere $\mathbb S^m$, $m\ge1$, we prove a multiplicity result for orthogonal geodesic chords in Riemannian manifolds with boundary that are diffeomorphic to…
We give bounds on geodesic distances on the Stiefel manifold, derived from new geometric insights. The considered geodesic distances are induced by the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021), which…
The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…
We characterize geodesic paths in the $n$-dimensional unit sphere under sup norm. A geodesic path between two points is a shortest curve joining the two points.
We interpret the close link between the critical points of Mather's barrier functions and minimal homoclinic orbits with respect to the Aubry sets on $\mathbb{T}^n$. We also prove a critical point theorem for barrier functions, and the…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they…
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least…
We obtain a result about the existence of only a finite number of geodesics between two fixed non-conjugate points in a Finsler manifold endowed with a convex function. We apply it to Randers and Zermelo metrics. As a by-product, we also…
A closed, orientable, splitting surface in an oriented $3$-manifold is a topologically minimal surface of index $n$ if its associated disk complex is $(n-2)$-connected but not $(n-1)$-connected. A critical surface is a topologically minimal…
We provide an easy approach to the geodesic distance on the general linear group GL(n) for left-invariant Riemannian metrics which are also right-O(n)-invariant. The parametrization of geodesic curves and the global existence of length…
The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…
Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…
In this paper, free boundary geodesic networks whose length realize the first min-max width of the length functional are investigated. This functional acts on the space of relative flat 1-dimensional cycles modulo 2 in a compact surface…
We construct convex bodies that can be "captured by nets." More precisely, for each dimension $n \geq 2$, we construct a family of Riemannian $n$-spheres, each with a stable geodesic net, which is a stable 1-dimensional integral varifold.…
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…
Length-bounded sweepouts provide a method for bounding the length of the shortest closed geodesic of a closed manifold. In this paper, we generalize this approach to the case of compact 2-dimensional orbifolds homeomorphic to S^2 as well as…
In this paper, we study the relation between geodesic and harmonic mappings. Harmonic mappings are defined between Riemannian manifolds as critical points of the energy functional, on the other hand, geodesic mappings are defined in a more…