Related papers: Minimal Lipschitz and $\infty$-Harmonic Extensions…
A classification of upper semicontinuous, translation and dually epi-translation invariant valuations is established on the space of convex Lipschitz function on $\mathbb{R}$ with compact domain.
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
The goal of this contribution is to investigate L${}^2$ extension properties for holomorphic sections of vector bundles satisfying weak semi-positivity properties. Using techniques borrowed from recent proofs of the Ohsawa-Takegoshi…
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…
Many elliptic boundary value problems exhibit an interior regularity property, which can be exploited to construct local approximation spaces that converge exponentially within function spaces satisfying this property. These spaces can be…
How can we interpret the infimum of Lipschitz constants in a conjugacy class of interval maps? For positive entropy maps, the exponential of the topological entropy gives a well-known lower bound. We show that for piecewise monotone…
We consider the regular Lagrangian flow X associated to a bounded divergence-free vector field b with bounded variation. We prove a Lusin-Lipschitz regularity result for X and we show that the Lipschitz constant grows at most linearly in…
Techniques based on minimal graph cuts have become a standard tool for solving combinatorial optimization problems arising in image processing and computer vision applications. These techniques can be used to minimize objective functions…
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
In Euclidean space of dimension 2 or 3, we study a minimum time problem associated with a system of real-analytic vector fields satisfying H\"ormander's bracket generating condition, where the target is a nonempty closed set. We show that,…
We study recovery of piecewise-constant signals on graphs by the estimator minimizing an $l_0$-edge-penalized objective. Although exact minimization of this objective may be computationally intractable, we show that the same statistical…
We develop a Lagrange multiplier theory for nonconvex set-valued optimization problems under Lipschitz-type regularity conditions. Instead of classical continuous linear functionals, we introduce closed convex processes -- set-valued…
We study proximal random reshuffling for minimizing the sum of locally Lipschitz functions and a proper lower semicontinuous convex function without assuming coercivity or the existence of limit points. The algorithmic guarantees pertaining…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…
In this work we prove a new $L^p$ holomorphic extension result for functions defined on product Lipschitz surfaces with small Lipschitz constants in two complex variables. We define biparameter and partial Cauchy integral operators that…
We prove estimates relating exponential or sub-exponential volume growth of weighted graphs to the bottom of the essential spectrum for general graph Laplacians. The volume growth is computed with respect to a metric adapted to the…
We consider the general problem of finding the minimum weight $\bm$-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP)…
This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…