Related papers: Mumford-Shah functionals on graphs and their asymp…
We show that inverse problems with a truncated quadratic regularization are NP-hard in general to solve, or even approximate up to an additive error. This stands in contrast to the case corresponding to a finite-dimensional approximation to…
We analyze the topological structure of the Nehari set for a class of functionals depending on a real parameter $\lambda$, and having two degrees of homogeneity. A special attention is paid to the extremal parameter $\lambda^*$, which is…
In [8], G. David suggested a new type of global minimizer for the Mumford-Shah functional in $\R^3$, for which the singular sets belong to a three parameters family of sets ($0<\delta\_1,\delta\_2,\delta\_3<\pi$). We first derive necessary…
A new necessary minimality condition for the Mumford-Shah functional is derived by means of second order variations. It is expressed in terms of a sign condition for a nonlocal quadratic form on $H^1_0(\Gamma)$, $\Gamma$ being a submanifold…
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions of this system by means of composition with…
We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of…
Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the…
Modeling functions that are sequentially observed as functional time series is becoming increasingly common. In such models, it is often crucial to ensure data homogeneity. We investigate the sensitivity of graph-based change point…
Given a complete doubling metric measure space $X$ that supports a $2$-Poincar\'e inequality, we approximate harmonic functions on a bounded domain $\Omega$ with a prescribed Newton-Sobolev boundary data. Our approach is based on the…
This paper is devoted to the approximation of differentiable semialgebraic functions by Nash functions. Approximation by Nash functions is known for semialgebraic functions defined on an affine Nash manifold M, and here we extend it to…
Compressing piecewise smooth images is important for many data types such as depth maps in 3D videos or optic flow fields for motion compensation. Specialised codecs that rely on explicitly stored segmentations excel in this task since they…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz…
Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise…
Given a family of locally Lipschitz vector fields $X(x)=(X_1(x),\dots,X_m(x))$ on $\mathbb{R}^n$, $m\leq n$, we study integral functionals depending on $X$. Using the results in \cite{MPSC1}, we study the convergence of minima, minimizers…
Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size…
We consider variational regularization of nonlinear inverse problems in Banach spaces using Tikhonov functionals. This article addresses the problem of $\Gamma$-convergence of a family of Tikhonov functionals and assertions of the…
For a bounded smooth domain in the plane and smooth boundary data we consider the minimisation of the Willmore functional for graphs subject to Dirichlet or Navier boundary conditions. For $H^2$-regular graphs we show that bounds for the…
$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\mathbb{Z}$. For $M \in \N$, an \emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping…