Related papers: Minimal networks on S^2
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
Given a set of $n$ terminals, which are points in $d$-dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that connects each pair of terminals by a Manhattan path, that is,…
Motivated by the shape of transportation networks such as subways, we consider a distribution of points in the plane and ask for the network $G$ of given length $L$ that is optimal in a certain sense. In the general model, the optimality…
It is known that the so-called rotation minimizing (RM) frames allow for a simple and elegant characterization of geodesic spherical curves in Euclidean, hyperbolic, and spherical spaces through a certain linear equation involving the…
The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\geq 0$ additional points, such that the length of the longest…
We investigate the minimization of a quadratic function over Stiefel manifolds (the set of all orthogonal $r$- frames in $\mathbf{R}^n$), which has applications in high-dimensional semi-supervised classification tasks. To reduce the…
It is well-known that the class of piecewise smooth curves together with a smooth Riemannian metric induces a metric space structure on a manifold. However, little is known about the minimal regularity needed to analyze curves and…
This mini-course was given in the First Yaroslavl Summer School on Discrete and Computational Geometry in August 2012, organized by International Delaunay Laboratory "Discrete and Computational Geometry" of Demidov Yaroslavl State…
We quantify the dynamical implications of the small-world phenomenon. We consider the generic synchronization of oscillator networks of arbitrary topology, and link the linear stability of the synchronous state to an algebraic condition of…
We consider the consensual distributed optimization problem in the Riemannian context. Specifically, the minimization of a sum of functions form is studied where each individual function in the sum is located at the node of a network. An…
We consider the minimum distance projection in the $L_2$-norm from an arbitrary point in an $n$-dimensional, Euclidian space onto the canonical simplex. It is shown that this problem reduces to a univariate problem that can be solved by a…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
Covariance matrices have attracted attention for machine learning applications due to their capacity to capture interesting structure in the data. The main challenge is that one needs to take into account the particular geometry of the…
We study the generalized minimum Manhattan network (GMMN) problem: given a set $P$ of pairs of two points in the Euclidean plane $\mathbb{R}^2$, we are required to find a minimum-length geometric network which consists of axis-aligned…
Analyzing changes in network evolution is central to statistical network inference, as underscored by recent challenges of predicting and distinguishing pandemic-induced transformations in organizational and communication networks. We…
In this paper we establish a relationship between geodesic nets and critical points of the distance function. We bound the number of balanced points for certain minimizing geodesic nets on manifolds homeomorphic to the $n$-sphere. We also…
We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation…
A complex network is a condensed representation of the relational topological framework of a complex system. A main reason for the existence of such networks is the transmission of items through the entities of these complex systems. Here,…
We introduce a class of minimal submanfolds $M^n$, $n\geq 3$, in spheres $\mathbb{S}^{n+2}$ that are ruled by totally geodesic spheres of dimension $n-2$. If simply-connected, such a submanifold admits a one-parameter associated family of…
We consider the scenario of supervised learning in Deep Learning (DL) networks, and exploit the arbitrariness of choice in the Riemannian metric relative to which the gradient descent flow can be defined (a general fact of differential…