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

We study geodesics of Hofer's metric on the space of Lagrangian submanifolds in arbitrary symplectic manifolds from the variational point of view. We give a characterization of length-critical paths with respect to this metric. As a result,…

We study the existence of minimal networks in the unit sphere $\mathbf{S}^d$ and the unit ball $\mathbf{B}^d$ of $\mathbf{R}^d$ endowed with Riemannian metrics close to the standard ones. We employ a finite-dimensional reduction method,…

We use nonsmooth critical point theory and the theory of geodesics with obstacle to show a multiplicity result about orthogonal geodesic chords in a Riemannian manifold (with boundary) which is homeomorphic to an $N$-disk. This applies to…

We argue that the minimal length discretization generalizing the Heisenberg uncertainty principle, in which the gravitational impacts on the non--commutation relations are thoughtfully taken into account, radically modifies the spacetime…

On a complete, connected, locally compact, non-compact geodesic space $(X,d)$, we assign each compact set a distance-like function. With the help of these functions, we obtain a pseudo-metric on the space of (non-empty) compact subsets of…

In this paper, we present a new method for computing approximate geodesic distances. We introduce the wave method for approximating geodesic distances from a point on a manifold mesh. Our method involves the solution of two linear systems…

We construct a minimum tree for some boundary symmetric tetrahedra R^3, which has two nodes (interior points) with equal weights (positive numbers) having the property that the common perpendicular of some two opposite edges passes through…

When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…

We first introduce a class of divergence measures between power spectral density matrices. These are derived by comparing the suitability of different models in the context of optimal prediction. Distances between "infinitesimally close"…

Centrality measures quantify the importance of a node in a network based on different geometric or diffusive properties, and focus on different scales. Here, we adopt a geometrical viewpoint to define a multi-scale centrality in networks.…

On the two dimensional sphere, we consider axisymmetric critical points of an isoperimetric problem perturbed by a long-range interaction term. When the parameter controlling the nonlocal term is sufficiently large, we prove the existence…

We discuss the enumeration of planar graphs using bijections with suitably decorated trees, which allow for keeping track of the geodesic distances between faces of the graph. The corresponding generating functions obey non-linear recursion…

In this article, we prove a generalization of our previous result in [12]. In particular, we show that for an $n$-dimensional, simply connected Riemannian manifold with diameter $D$ and volume $V$. Suppose that $M$ admits a good cover…

Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…

Suppose $M$ is a complete, non-compact $n$-dimensional Riemannian manifold with locally convex ends and finite volume. We prove that $M$ admits a non-trivial geodesic net with one vertex, at most $(n+2)(n+1)/2$ edges, and total length at…

We show that the shortest closed geodesic on a 2-sphere with non-negative curvature has length bounded above by three times the diameter. We prove a new isoperimetric inequality for 2-spheres with pinched curvature; this allows us to…

In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…

Given a graph or similarity matrix, we consider the problem of recovering a notion of true distance between the nodes, and so their true positions. We show that this can be accomplished in two steps: matrix factorisation, followed by…

On a Riemannian manifold with a positive lower bound on the Ricci tensor, the distance of isoperimetric sets from geodesic balls is quantitatively controlled in terms of the gap between the isoperimetric profile of the manifold and that of…

A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in certain interconnection networks such as mesh of trees, and…