Related papers: L-Infininity Variational Problems for Maps and the…
In the decremental single-source shortest paths problem, the goal is to maintain distances from a fixed source $s$ to every vertex $v$ in an $m$-edge graph undergoing edge deletions. In this paper, we conclude a long line of research on…
As shown in [15], under some structural assumptions, working on congested traffic problems in general and increasingly dense networks leads, at the limit by {\Gamma}-convergence, to continuous minimization problems posed on measures on…
Shape optimization has been playing an important role in a large variety of engineering applications. Existing shape optimization methods are generally mesh-dependent and therefore encounter challenges due to mesh deformation. To overcome…
We investigate the family of marked Thurston maps that are defined everywhere on the topological sphere $S^2$, potentially excluding at most countable closed set of essential singularities. We show that when an unmarked Thurston map $f$ is…
In this paper, we give an estimate of sub-Laplacian of Riemannian distance functions in pseudo-Hermitian geometry which plays a similar role as Laplacian comparison theorem in Riemannian geometry, and deduce a prior horizontal gradient…
One fundamental problem in decentralized multi-agent optimization is the trade-off between gradient/sampling complexity and communication complexity. We propose new algorithms whose gradient and sampling complexities are graph topology…
We present a class of functions $\mathcal{K}$ in $C^0(\R)$ which is variant of the Knopp class of nowhere differentiable functions. We derive estimates which establish $\mathcal{K} \sub C^{0,\al}(\R)$ for $0<\al<1$ but no $K \in…
The significant progress in constructing graph spanners that are sparse (small number of edges) or light (low total weight) has skipped spanners that are everywhere-sparse (small maximum degree). This disparity is in line with other network…
We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as $M=\Phi U +…
Our goal is to provide a novel method of representing 2D shapes, where each shape will be assigned a unique fingerprint - a computable approximation to a conformal map of the given shape to a canonical shape in 2D or 3D space (see page 22…
We introduce a new numerical method to approximate the solution of a finite horizon deterministic optimal control problem. We exploit two Hamilton-Jacobi-Bellman PDE, arising by considering the dynamics in forward and backward time. This…
The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved non convex…
We consider a potential $W:R^m\rightarrow R$ with two different global minima $a_-, a_+$ and, under a symmetry assumption, we use a variational approach to show that the Hamiltonian system \begin{equation} \ddot{u}=W_u(u), \hskip 2cm (1)…
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees,…
We consider weak solutions $u:\Omega_{T}\rightarrow\mathbb{R}^{N}$ to parabolic systems of the type \[ u_{t}-\mathrm{div}\,A(x,t,Du)=f \qquad \mathrm{in}\ \Omega_{T}=\Omega\times(0,T), \] where $\Omega$ is a bounded open subset of…
Let $f:M\ra \erre^{m+1}$ be an isometrically immersed hypersurface. In this paper, we exploit recent results due to the authors in \cite{bimari} to analyze the stability of the differential operator $L_r$ associated with the $r$-th Newton…
We investigate the multiplicity of solutions for a generalized poly-Laplacian system on weighted finite graphs and a generalized poly-Laplacian system with Dirichlet boundary value on weighted locally finite graphs, respectively, via the…
We consider the discrete Schr\"odinger operator $H=-\Delta+V$ on a cube $M\subset \mathbb{Z}^d$, with periodic or Dirichlet (simple) boundary conditions. We use a hidden landscape function $u$, defined as the solution of an inhomogeneous…
We consider the problem of finding a real number lambda and a function u satisfying the PDE max{lambda -\Delta u -f,|Du|-1}=0, for all x in R^n. Here f is a convex, superlinear function. We prove that there is a unique lambda* such that the…
In the semi-discrete version of Monge's problem one tries to find a transport map $T$ with minimum cost from an absolutely continuous measure $\mu$ on $\mathbb{R}^d$ to a discrete measure $\nu$ that is supported on a finite set in…