Related papers: Random assignment problems on ${2d}$ manifolds
We address the problem of minimizing a smooth function under smooth equality constraints. Under regularity assumptions on these constraints, we propose a notion of approximate first- and second-order critical point which relies on the…
In this work, we introduce a novel local pairwise descriptor and then develop a simple, effective iterative method to solve the resulting quadratic assignment through sparsity control for shape correspondence between two approximate…
We study minimum vertex cover problems on random \alpha-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase…
Alternating projections and their variants are classical tools for computing points in intersections of sets. Existing analyses for smooth manifolds mainly focus on local convergence rates under transversality or related regularity…
In this paper, we study the minimization of $\lambda_{1}(\Omega)$, the first Dirichlet eigenvalue of the Laplace-Beltrami operator, within the class of open sets $\Omega$ of fixed volume in a Riemmanian manifold $(M,g)$. In the Euclidian…
Motivated by the classic Generalized Assignment Problem, we consider the Graph Balancing problem in the presence of orientation costs: given an undirected multi-graph G = (V,E) equipped with edge weights and orientation costs on the edges,…
We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/sqrt(d) pivot steps on any simple d-polytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a…
Understanding the role of randomness when solving locally checkable labeling (LCL) problems in the LOCAL model has been one of the top priorities in the research on distributed graph algorithms in recent years. For LCL problems in…
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…
We study regularity properties of solutions to operator equations on patchwise smooth manifolds $\partial\Omega$ such as, e.g., boundaries of polyhedral domains $\Omega \subset \mathbb{R}^3$. Using suitable biorthogonal wavelet bases…
We deal with a spectral problem for the Laplace-Beltrami operator posed on a stratified set $\Omega$ which is composed of smooth surfaces joined along a line $\gamma$, the junction. Through this junction we impose the Kirchhoff-type vertex…
This paper aims to investigate the distributed stochastic optimization problems on compact embedded submanifolds (in the Euclidean space) for multi-agent network systems. To address the manifold structure, we propose a distributed…
We consider the equation $- \e^2 \D u + u= u^p$ in $\Omega \subseteq \R^N$, where $\Omega$ is open, smooth and bounded, and we prove concentration of solutions along $k$-dimensional minimal submanifolds of $\partial \O$, for $N \geq 3$ and…
We consider a \emph{family} $(P_\omega)_{\omega \in \Omega}$ of elliptic second order differential operators on a domain $U_0 \subset \mathbb{R}^m$ whose coefficients depend on the space variable $x \in U_0$ and on $\omega \in \Omega,$ a…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
The paper deals with the asymptotic behavior as $\eps\to 0$ of the spectrum of Laplace-Beltrami operator $\Delta\e$ on the Riemannian manifold $M\e$ ($\mathrm{\dim} M\e=N\geq 2$) depending on a small parameter $\eps>0$. $M\e$ consists of…
In the Tree Augmentation problem we are given a tree $T=(V,F)$ and a set $E \subseteq V \times V$ of edges with positive integer costs $\{c_e:e \in E\}$. The goal is to augment $T$ by a minimum cost edge set $J \subseteq E$ such that $T…
We consider the following problem: on any given complete Riemannian manifold $(M,g)$, among all curves which have fixed length as well as fixed end-points and tangents at the end-points, minimise the $L^\infty$ norm of the curvature. We…
Finding the global minimum of a cost function given by the sum of a quadratic and a linear form in N real variables over (N-1)- dimensional sphere is one of the simplest, yet paradigmatic problems in Optimization Theory known as the "trust…
We study the problem of reconstructing a perfect matching $M^*$ hidden in a randomly weighted $n\times n$ bipartite graph. The edge set includes every node pair in $M^*$ and each of the $n(n-1)$ node pairs not in $M^*$ independently with…