Related papers: Minimal Lipschitz and $\infty$-Harmonic Extensions…
Extending functions from boundary values plays an important role in various applications. In this thesis we consider discrete and continuous formulations of the problem based on $p$-Laplacians, in particular for $p=\infty$ and tight…
We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely…
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…
Tackling semi-supervised learning problems with graph-based methods has become a trend in recent years since graphs can represent all kinds of data and provide a suitable framework for studying continuum limits, e.g., of differential…
Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
Aim of this note is to study the infinity Laplace operator and the corresponding Absolutely Minimizing Lipschitz Extension problem on the Sierpinski gasket in the spirit of the classical construction of Kigami for the Laplacian. We…
This paper proves comparison principles for elliptic PDE involving the Finsler infinity Laplacian, a second-order differential operator with discontinuities in the gradient variable arising in $L^{\infty}$-variational problems and…
This work studies the typical behavior of random integer-valued Lipschitz functions on expander graphs with sufficiently good expansion. We consider two families of functions: M-Lipschitz functions (functions that change by at most M along…
Consider a bounded open set $U$ in $R^n$ and a Lipschitz function g from the boundary of $U$ to $R^m$. Does this function always have a canonical optimal Lipschitz extension to all of $U$? We propose a notion of optimal Lipschitz extension…
Let (X,d) be a metric space and $ \alpha > 0 $. In this paper, we study extensions of some complex-valued Lipschitz functions, from some special subset $ X_0 $ to X. These extensions are with no-increasing Lipschitz number or the smallest…
Many inequality relations between real vector quantities can be succinctly expressed as "weak (sub)majorization" relations. We explain these ideas and apply them in several areas: angles between subspaces, Ritz values, and graph Laplacian…
Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
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…
This paper addresses theory and applications of $\ell_p$-based Laplacian regularization in semi-supervised learning. The graph $p$-Laplacian for $p>2$ has been proposed recently as a replacement for the standard ($p=2$) graph Laplacian in…
Graph algorithms are widely used for decision making and knowledge discovery. To ensure their effectiveness, it is essential that their output remains stable even when subjected to small perturbations to the input because frequent output…
Let $Q$ be a first-order differential operator on a compact, smooth oriented Riemannian manifold with smooth boundary. Then, Friedrichs' extension lemma states that the minimal closed extension $Q_{min}$ (the closure of the graph) and the…
Given a Hermitian vector bundle over an infinite weighted graph, we define the Laplacian associated to a unitary connection on this bundle and study the essential self-adjointness of a perturbation of this Laplacian by an operator-valued…
This paper deals with the study of parameter dependence of extensions of Lipschitz mappings from the point of view of continuity. We show that if assuming appropriate curvature bounds for the spaces, the multivalued extension operators that…