Related papers: Kirszbraun extension on connected finite graph
Utilizing our recent proximal-average based results on the constructive extension of monotone operators, we provide a novel approach to the celebrated Kirszbraun-Valentine Theorem and to the extension of firmly nonexpansive mappings.
The classical Kirszbraun theorem says that all $1$-Lipschitz functions $f:A\longrightarrow \mathbb{R}^n$, $A\subset \mathbb{R}^n$, with the Euclidean metric have a $1$-Lipschitz extension to $\mathbb{R}^n$. For metric spaces $X,Y$ we say…
Let $X,Y$ be two Hilbert spaces, $E$ a subset of $X$ and $G: E \to Y$ a Lipschitz mapping. A famous theorem of Kirszbraun's states that there exists $\widetilde{G} : X \to Y$ with $\widetilde{G}=G$ on $E$ and…
In this paper, we prove a definable version of Kirszbraun's theorem in a non-Archimedean setting for definable families of functions in one variable. More precisely, we prove that every definable function $f : X \times Y \to…
We rigorously derive the dense graph limit of a discrete model describing the formation of biological transportation networks. The discrete model, defined on undirected graphs with pressure-driven flows, incorporates a convex energy…
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…
We derive a stronger uniqueness result if a function with compact support and its truncated Hilbert transform are known on the same interval by using the Sokhotski-Plemelj formulas. To find a function from its truncated Hilbert transform,…
We obtain tight bounds on Poisson tails which are easy to handle. A short proof based on the median of the gamma distribution is given. Numerical comparisons with other known estimates are made. As an application, we consider the rates of…
We develop a Lyapunov-based analysis of Korpelevich's extragradient method and show that it achieves an $o(1/k)$ last-iterate convergence rate of the constructed Lyapunov function. This Lyapunov function simultaneously upper bounds several…
The classical McShane-Whitney extension theorem for Lipschitz functions is refined by showing that for a closed subset of the domain, it remains valid for any interval of the real line. This result is also extended to the setting of locally…
We investigate the relationship between one of the classical notions of boundaries for infinite graphs, \emph{graph ends}, and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of…
We show that the extension map \[ \mathcal{E}_{NS}(f)(z)=\frac{f(x+y)+f(x-y)}{2}+i\frac{f(x+y)-f(x-y)}{2}\mbox{ for all }z=x+iy\in\mathbb{H}\,, \] defined by Norton and Sullivan in '96, is the only locally linear extension map taking…
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…
We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…
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…
This paper provides a rigorous and delicate analysis for exponential decay of Jacobi polynomial expansions of analytic functions associated with the Bernstein ellipse. Using an argument that can recover the best estimate for the Chebyshev…
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
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…
The $r$-expansion of a $k$-uniform hypergraph $H$, denoted by $H^{(+r)}$, is an $r$-uniform hypergraph obtained by enlarging each $k$-edge of $H$ with a set of $r-k$ vertices of degree one. The random Tur\'an number…
The extension of an $r$-uniform hypergraph $G$ is obtained from it by adding for every pair of vertices of $G$, which is not covered by an edge in $G$, an extra edge containing this pair and $r-2$ new vertices. Keevash and Sidorenko~ have…