相关论文: The $L^1$-relaxed area of the graph of the vortex …

The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…

We consider the relaxation of polyconvex functionals with linear growth with respect to the strict convergence in the space of functions of bounded variation. These functionals appears as relaxation of $F(u,\Omega):=\int_\Omega f(\nabla…

In this note, we study the Liouville equation $\Delta u = -e^u$ on a graph G satisfying certain isoperimetric inequality. Following the idea of W. Ding, we prove that there exists a uniform lower bound for the energy, $\Sigma_G e^u$ of any…

The `lake equation' on a planar domain D with bathymetry b(x,y) is given by $ \partial_t u + (u \cdot {\rm grad}) u= -{\rm grad}\, p \,, \,\,{\rm div} (b u) = 0 \,,\, \text{with}\,\, u \parallel \partial D.$ % \, \,\, \,\,\, \text{),}$$ We…

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover, a type of integer programming (IP) problem. A lattice-gas model on the Erd\"os-R\'enyi random graphs of $\alpha$-uniform…

Given a bounded open connected Lipschitz set $\Omega \subset \mathbb R^2$, we show that the relaxed Cartesian area functional $\overline{\mathcal A}(u,\Omega)$ of a map $u\in W^{1,1}(\Omega;\mathbb S^1)$ is finite, and provide a useful…

Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…

We prove norm-resolvent and spectral convergence in $L^2$ of solutions to the Neumann Poisson problem $-\Delta u_\varepsilon = f$ on a domain $\Omega_\varepsilon$ perforated by Dirichlet-holes and shrinking to a 1-dimensional interval. The…

We consider several basic questions pertaining to the geometry of image of a general quadratic map. In general the image of a quadratic map is non-convex, although there are several known classes of quadratic maps when the image is convex.…

We consider the Ginzburg-Landau equation in the plane linearized around the standard degree-one vortex solution $W(x)=w(r)e^{i\theta}$. Using explicit representation formulae for the Fourier modes in $\theta$, we obtain sharp estimates for…

In this paper, we study the graph-theoretic analogues of vector Laplacian (or Helmholtz operator) and vector Laplace equation. We determine the graph matrix representation of vector Laplacian and obtain the dimension of solution space of…

Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative integers such that for any pair of vertices $(u,v),|f (u) - f (v)| \ge p$ if $u$ and $v$ are adjacent, and $f(u) \neq f(v)$…

In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…

A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a…

It is known that the vertex connectivity of a planar graph can be computed in linear time. We extend this result to the class of locally maximal 1-plane graphs: graphs that have an embedding with at most one crossing per edge such that the…

For a graph $G$, the unraveled ball of radius $r$ centered at a vertex $v$ is the ball of radius $r$ centered at $v$ in the universal cover of $G$. We obtain a lower bound on the weighted spectral radius of unraveled balls of fixed radius…

We consider the MAP-inference problem for graphical models, which is a valued constraint satisfaction problem defined on real numbers with a natural summation operation. We propose a family of relaxations (different from the famous…

Using a geometric construction, we solve Plateau's Problem in the Heisenberg group $\mathbb{H}^{1}$ for intrinsic graphs defined on a convex domain $D$, under a smallness condition either on the boundary $\partial D$ or on the Lipschitz…

The recently introduced $\{k\}$-packing function problem is considered in this paper. Special relation between a case when $k=1$, $k\ge 2$ and linear programming relaxation is introduced with sufficient conditions for optimality. For…

In this paper, we study the average size of independent (vertex) sets of a graph. This invariant can be regarded as the logarithmic derivative of the independence polynomial evaluated at $1$. We are specifically concerned with extremal…