Related papers: Lipschitz functions on weak expanders

Kolmogorov famously proved that multivariate continuous functions can be represented as a superposition of a small number of univariate continuous functions, $$ f(x_1,\dots,x_n) = \sum_{q=0}^{2n+1} \chi^q \left( \sum_{p=1}^n \psi^{pq}(x_p)…

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…

Let $D$ be a connected bounded domain in $\R^2$, $S$ be its boundary which is closed, connected and smooth. Let $\Phi(z)=\frac 1 {2\pi i}\int_S\frac{f(s)ds}{s-z}$, $f\in L^1(S)$, $z=x+iy$. Boundary values of $\Phi(z)$ on $S$ are studied.…

A multiple-valued function $f:X\to {\bf Q}_Q(Y)$ is essentially a rule assigning $Q$ unordered and non necessarily distinct elements of $Y$ to each element of $X$. We study the Lipschitz extension problem in this context by using two…

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…

Let $L = \Delta + V$ be a Schr\"odinger operator with a non-negative potential $V$ on a complete Riemannian manifold $M$. We prove that the vertical Littlewood-Paley-Stein functional associated with $L$ is bounded on $L^p(M)$ {\it if and…

For a fixed constant $\lambda > 0$ and a bounded Lipschitz domain $\Omega \subset \mathbb{R}^n$ with $n \geq 2$, we establish that almost-minimizers (functions satisfying a sort of variational inequality) of the Alt-Caffarelli type…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

We present a framework for performing efficient regression in general metric spaces. Roughly speaking, our regressor predicts the value at a new point by computing a Lipschitz extension --- the smoothest function consistent with the…

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. assumption does not hold. We consider learning problems in…

A partial order on the set of metric measure spaces is defined; it generalizes the Lipschitz order of Gromov. We show that our partial order is closed when metric measure spaces are equipped with the Gromov-weak topology and give a new…

On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…

Recently, Balla, Janzer, and Sudakov showed a lower bound on the MaxCut in terms of the vector chromatic number, recovering known results on the MaxCut of $H$-free graphs. In this note, we show that their bound is tight, providing a…

There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the…

We develop a new multi-scale framework flexible enough to solve a number of problems involving embedding random sequences into random sequences. Grimmett, Liggett and Richthammer asked whether there exists an increasing M-Lipschitz…

Let $X$ be a separable real Hilbert space. We show that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and for every $\epsilon>0$, there exists a Lipschitz, real analytic function $g:X\rightarrow\mathbb{R}$ such that…

We prove that, for r>2, the r-variation and oscillation for the smooth truncations of the Cauchy transform on Lipschitz graphs are bounded in L^p for 1<p finite. The analogous result holds for the n-dimensional Riesz transform on…

Uniform integer-valued Lipschitz functions on a domain of size $N$ of the triangular lattice are shown to have variations of order $\sqrt{\log N}$. The level lines of such functions form a loop $O(2)$ model on the edges of the hexagonal…

Let $G$ be a connected simple graph on $n$ vertices and $m$ edges. Denote $N_{i}^{(j)}(G)$ the number of spanning subgraphs of $G$ having precisely $i$ edges and not more than $j$ connected components. The graph $G$ is \emph{strong} if…

We propose a random graph model with preferential attachment rule and \emph{edge-step functions} that govern the growth rate of the vertex set. We study the effect of these functions on the empirical degree distribution of these random…