Related papers: Minimal networks on S^2
We introduce a new paradigm, $\textit{measure synchronization}$, for synchronizing graphs with measure-valued edges. We formulate this problem as maximization of the cycle-consistency in the space of probability measures over relative…
The objective of this work is twofold. On one hand, it is intended as a short introduction to spin networks and invariants of 3-manifolds. It covers the main areas needed to have a first understanding of the topics involved in the…
We study Turing bifurcations on one-dimensional random ring networks where the probability of a connection between two nodes depends on the distance between the two nodes. Our approach uses the theory of graphons to approximate the graph…
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…
On some specified convex supporting sets of spheres, we find a generalized longitude function whose level sets are totally geodesic. Given an arbitrary (weakly) harmonic map into spheres, the composition of the generalized longitude…
We discuss several parametrizations of the space of circular planar electrical networks. For any circular planar network we associate a canonical minimal network with the same response matrix, called a "standard" network. The conductances…
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…
We present a formal measure-theoretical theory of neural networks (NN) built on probability coupling theory. Our main contributions are summarized as follows. * Built on the formalism of probability coupling theory, we derive an algorithm…
In this paper we present a mathematical framework on linking of embeddings of compact topological spaces into Euclidean spaces and separability of linked embeddings under a specific class of dimension reduction maps. As applications of the…
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional…
We define discrete constant mean curvature (cmc) surfaces in the three-dimensional Euclidean and Lorentz spaces in terms of sphere packings with orthogonally intersecting circles. These discrete cmc surfaces can be constructed from…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
We define a new measure of network symmetry that is capable of capturing approximate global symmetries of networks. We apply this measure to different networks sampled from several classic network models, as well as several real-world…
The Dirichlet Laplacian in a curved three-dimensional tube built along a spatial (bounded or unbounded) curve is investigated in the limit when the uniform cross-section of the tube diminishes. Both deformations due to bending and twisting…
Let $M$ be a complete, connected Riemannian surface and suppose that $\mathcal{S} \subset M$ is a discrete subset. What can we learn about $M$ from the knowledge of all distances in the surface between pairs of points of $\mathcal{S}$? We…
We study the properties of sets $\Sigma$ which are the solutions of the maximal distance minimizer problem, id est of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…
We continue our study, initiated in our earlier paper, of Riemann surfaces with constant curvature and isolated conic singularities. Using the machinery developed in that earlier paper of extended configuration families of simple divisors,…
We consider the consensus problem in a decentralized network, focusing on a compact submanifold that acts as a nonconvex constraint set. By leveraging the proximal smoothness of the compact submanifold, which encompasses the local singleton…
We study synchronization dynamics in networks of coupled oscillators with bimodal distribution of natural frequencies. This setup can be interpreted as a simple model of frequency synchronization dynamics among generators and loads working…