Related papers: Minimal networks on S^2
Consider a network with $N$ nodes in $d$-dimensional Euclidean space, and $M$ subsets of these nodes $P_1,\cdots,P_M$. Assume that the nodes in a given $P_i$ are observed in a local coordinate system. The registration problem is to compute…
We construct flat metrics in a given conformal class with prescribed singularities of real orders at marked points of a closed real surface. The singularities can be small conical, cylindrical, and large conical with possible translation…
Real networks are finite metric spaces. Yet the geometry induced by shortest path distances in a network is definitely not its only geometry. Other forms of network geometry are the geometry of latent spaces underlying many networks, and…
In this paper, we introduce the Fixed Topology Minimum-Length Tree with Neighborhood Problem, which aims to embed a rooted tree-shaped graph into a $d$-dimensional metric space while minimizing its total length provided that the nodes must…
Minimum numbers of fixed points or of coincidence components (realized by maps in given homotopy classes) are the principal objects of study in topological fixed point and coincidence theory. In this paper we investigate fiberwise analoga…
In this Letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their…
It is nearly 20 years since the concept of a small-world network was first quantitatively defined, by a combination of high clustering and short path length; and about 10 years since this metric of complex network topology began to be…
The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication…
Network Design problems typically ask for a minimum cost sub-network from a given host network. This classical point-of-view assumes a central authority enforcing the optimum solution. But how should networks be designed to cope with…
A spatial network is constructed on a two dimensional space where the nodes are geometrical points located at randomly distributed positions which are labeled sequentially in increasing order of one of their co-ordinates. Starting with $N$…
A spin network is a cubic ribbon graph labeled by representations of $\mathrm{SU}(2)$. Spin networks are important in various areas of Mathematics (3-dimensional Quantum Topology), Physics (Angular Momentum, Classical and Quantum Gravity)…
We study the problem of augmenting the locus $\mathcal{N}_{\ell}$ of a plane Euclidean network $\mathcal{N}$ by inserting iteratively a finite set of segments, called \emph{shortcut set}, while reducing the diameter of the locus of the…
We develop a geometric approach to spin networks with Heisenberg or XX coupling. Geometry is acquired by defining a distance on the discrete set of spins. The key feature of the geometry of such networks is their Gauss curvature $\kappa$,…
Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial maximal planar networks, which is similar to but different…
We study the optimization problem associated with fitting two-layer ReLU neural networks with respect to the squared loss, where labels are generated by a target network. We make use of the rich symmetry structure to develop a novel set of…
Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…
We develop an analytic theory of existence and regularity of surfaces (given by graphs) arising from the geometric minimization problem $$\min_{\mathcal{M}}\frac{1}{2}\int_{\mathcal{M}}|\nabla_{\mathcal{M}}H|^2\,dA$$ where $\mathcal{M}$…
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform…
We construct closed embedded minimal surfaces in the round three-sphere, resembling two parallel copies of the equatorial two-sphere, joined by small catenoidal bridges symmetrically arranged either along two parallel circles of the…
Decentralized optimization on Riemannian manifolds is foundational for many modern machine learning and signal processing applications in which data are non-Euclidean and generated and processed in a distributed manner. Although intrinsic…