Related papers: Lipschitz functions on weak expanders

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 establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for decomposable functions, improving Janson's Hoeffding-type…

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

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…

We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…

We prove that every locally finite vertex-transitive graph $G$ admits a non-constant Lipschitz harmonic function.

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…

In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…

Main results of the paper: (1) For any finite metric space $M$ the Lipschitz free space on $M$ contains a large well-complemented subspace which is close to $\ell_1^n$. (2) Lipschitz free spaces on large classes of recursively defined…

We provide sharp empirical estimates of expectation, variance and normal approximation for a class of statistics whose variation in any argument does not change too much when another argument is modified. Examples of such weak interactions…

Let (X, d) be a quasi-convex, complete and separable metric space with reference probability measure m. We prove that the set of of real valued Lipschitz function with non zero point-wise Lipschitz constant m-almost everywhere is residual,…

We construct a H\"older continuous function on the unit interval which coincides in uncountably (in fact continuum) many points with every function of total variation smaller than 1 passing through the origin. We say that a function with…

The main paradigm of smoothed analysis on graphs suggests that for any large graph $G$ in a certain class of graphs, perturbing slightly the edges of $G$ at random (usually adding few random edges to $G$) typically results in a graph having…

For $\alpha > 0$, the $\alpha$-Lipschitz minorant of a function $f: \mathbb{R} \to \mathbb{R}$ is the greatest function $m : \mathbb{R} \to \mathbb{R}$ such that $m \leq f$ and $|m(s)-m(t)| \le \alpha |s-t|$ for all $s,t \in \mathbb{R}$,…

We consider the fractal Sierpi\'{n}ski gasket or carpet graph in dimension $d\geq 2,$ denoted by $G$. At time $0$, we place a Poisson point process of particles onto the graph and let them perform independent simple random walks, which in…

In this paper we consider a dynamic Erd\H{o}s-R\'{e}nyi random graph with independent identically distributed edge processes. Our aim is to describe the joint evolution of the entries of a subgraph count vector. The main result of this…

Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.

We study the consistency of Lipschitz learning on graphs in the limit of infinite unlabeled data and finite labeled data. Previous work has conjectured that Lipschitz learning is well-posed in this limit, but is insensitive to the…

We study the problem of estimating the average of a Lipschitz continuous function $f$ defined over a metric space, by querying $f$ at only a single point. More specifically, we explore the role of randomness in drawing this sample. Our goal…

Let $T$ be an orientation-preserving Lipschitz expanding map of the circle $\T$. A pre-image selector is a map $\tau:\T\to\T$ with finitely many discontinuities, each of which is a jump discontinuity, and such that $\tau(x)\in T^{-1}(x)$…