Related papers: Curve Shortening and the Rendezvous Problem for Mo…
We consider an evolving plane curve with two endpoints that can move freely on the $x$-axis with generating constant contact angles. We discuss the asymptotic behavior of global-in-time solutions when the evolution of this plane curve is…
In this paper, we investigate some geometric properties of non-smooth random curves within a stochastic flow. We consider a polygonal line $\Gamma(\vec{u}_{1},\cdots,\vec{u}_{n})$, which connects the points…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
In this paper we use a gradient flow to deform closed planar curves to curves with least variation of geodesic curvature in the $L^2$ sense. Given a smooth initial curve we show that the solution to the flow exists for all time and,…
The paper studies a distributed gradient descent (DGD) process and considers the problem of showing that in nonconvex optimization problems, DGD typically converges to local minima rather than saddle points. The paper considers…
Given a planar curve, imagine rolling a sphere along that curve without slipping or twisting, and by this means tracing out a curve on the sphere. It is well known that such a rolling operation induces a local isometry between the sphere…
We introduce a new geometric flow called the chord shortening flow which is the negative gradient flow for the length functional on the space of chords with end points lying on a fixed submanifold in Euclidean space. As an application, we…
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…
The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces and provides a natural framework for aligning heterogeneous datasets. Alas, as exact computation of GW alignment is NP hard, entropic regularization…
The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs.…
Geometric frameworks for analyzing curves are common in applications as they focus on invariant features and provide visually satisfying solutions to standard problems such as computing invariant distances, averaging curves, or registering…
By an undirected rigid formation of mobile autonomous agents is meant a formation based on graph rigidity in which each pair of "neighboring" agents is responsible for maintaining a prescribed target distance between them. In a recent paper…
We consider the fundamental task of optimising a real-valued function defined in a potentially high-dimensional Euclidean space, such as the loss function in many machine-learning tasks or the logarithm of the probability distribution in…
This paper focuses on minimizing a smooth function combined with a nonsmooth regularization term on a compact Riemannian submanifold embedded in the Euclidean space under a decentralized setting. Typically, there are two types of approaches…
We investigate the motion of a family of closed curves evolving according to the geometric evolution law on a given two dimensional manifold which is embedded or immersed in the three-dimensional Euclidean space. We derive a system of…
Kohonen's Self-Organizing Maps (SOMs) have proven to be a successful data-reduction method to identify the intrinsic lower-dimensional sub-manifold of a data set that is scattered in the higher-dimensional feature space. Motivated by the…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. We consider the second Hamiltonian decomposition problem: for a 4-regular multigraph find 2 edge-disjoint Hamiltonian cycles different…
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
We study variational problems for curves approximated by B-spline curves. We show that, one can obtain discrete Euler-Lagrange equations, for the data describing the approximated curves. Our main application is to the curve completion…
RecentadvancesinDistributedComputinghighlightmodelsandalgo- rithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms…