Related papers: Lipschitz functions on weak expanders

We prove several results on Almgren's multiple valued functions and their links to integral currents. In particular, we give a simple proof of the fact that a Lipschitz multiple valued map naturally defines an integer rectifiable current;…

Let g : $\Omega$ = [0, 1] d $\rightarrow$ R denote a Lipschitz function that can be evaluated at each point, but at the price of a heavy computational time. Let X stand for a random variable with values in $\Omega$ such that one is able to…

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

We discuss the spectrum phenomenon for Lipschitz functions on the infinite-dimensional torus. Suppose that $f$ is a measurable, real-valued, Lipschitz function on the torus $\mathbb{T}^{\infty}$. We prove that there exists a number $a \in…

Let $f:X\to X$ be a continuous map on a compact metric space with finite topological entropy. Further, we assume that the entropy map $\mu\mapsto h_\mu(f)$ is upper semi-continuous. It is well-known that this implies the continuity of the…

This note shows that, for a fixed Lipschitz constant $L > 0$, one layer neural networks that are $L$-Lipschitz are dense in the set of all $L$-Lipschitz functions with respect to the uniform norm on bounded sets.

This note corrects a gap and improves results in an earlier paper by the first named author. More precisely, it is shown that on weakly compactly generated Banach spaces X which admit a C^{p} smooth norm, one can uniformly approximate…

Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…

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…

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…

A mapping $f:X\to Y$ between metric spaces is called \emph{little Lipschitz} if the quantity $$ \operatorname{lip}(f(x)=\liminf_{r\to0}\frac{\operatorname{diam} f(B(x,r))}{r} $$ is finite for every $x\in X$. We prove that if a compact (or,…

We study minimax lower bounds for function estimation problems on large graph when the target function is smoothly varying over the graph. We derive minimax rates in the context of regression and classification problems on graphs that…

We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…

Let $M$ denote the centered Hardy--Littlewood operator on $\mathbb{R}$. We prove that \[ {\rm Var} (Mf)\le {\rm Var} (f) - \frac12\big| |f(\infty)|-|f(-\infty)|\big| \] for piecewise constant functions $f$ with nonzero and zero values…

We consider adaptations of the Mumford-Shah functional to graphs. These are based on discretizations of nonlocal approximations to the Mumford-Shah functional. Motivated by applications in machine learning we study the random geometric…

We study regression of $1$-Lipschitz functions under a log-concave measure $\mu$ on $\mathbb{R}^d$. We focus on the high-dimensional regime where the sample size $n$ is subexponential in $d$, in which distribution-free estimators are…

In this paper we study Lipschitz regularity of elliptic PDEs on geometric graphs, constructed from random data points. The data points are sampled from a distribution supported on a smooth manifold. The family of equations that we study…

The motivation for this article is to derive strict convexity of the surface tension for Lipschitz random surfaces, that is, for models of random Lipschitz functions from $\mathbb Z^d$ to $\mathbb Z$ or $\mathbb R$. An essential innovation…

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…

In this paper we provide a characterization of intrinsic Lipschitz graphs in the sub-Riemannian Heisenberg groups in terms of their distributional gradients. Moreover, we prove the equivalence of different notions of continuous weak…