Related papers: Lipschitz functions on weak expanders

A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…

By the linearization property of Lipschitz-free spaces, any Lipschitz map $f : M \to N$ between two pointed metric spaces may be extended uniquely to a bounded linear operator $\widehat{f} : \mathcal F(M) \to \mathcal F(N)$ between their…

We study a class of semilinear diffusion equations on infinite, connected, weighted graphs, focusing on two types of nonlinearities: monotone decreasing and Lipschitz continuous. Under minimal structural assumptions on the graph, we…

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

The purpose of this survey article is a comprehensive study of operator Lipschitz functions. A continuous function $f$ on the real line ${\Bbb R}$ is called operator Lipschitz if $\|f(A)-f(B)\|\le{\rm const}\|A-B\|$ for arbitrary…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…

Eremenko and Lyubich proved that an entire function whose set of singular values is bounded is expanding at points where its image has large modulus. These expansion properties have been at the centre of the subsequent study of this class…

Our aim is to characterize the Lipschitz functions by variable exponent Lebesgue spaces. We give some characterizations of the boundedness of the maximal or nonlinear commutators of the Hardy-Littlewood maximal function and sharp maximal…

We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d,…

In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…

For a class $\mathcal C$ of graphs $G$ equipped with functions $f_G$ defined on subsets of $E(G)$ or $V(G)$, we say that $\mathcal{C}$ is $k$-scattered with respect to $f_G$ if there exists a constant $\ell$ such that for every graph $G\in…

Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…

We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with $t$ distinct edges of $K_n$ one by one, chosen uniformly at random. Builder may…

Under certain continuity conditions, we estimate upper and lower box dimension of graph of a function defined on the Sierpinski gasket. We also give an upper bound for Hausdorff dimension and box dimension of graph of function having finite…

It follows from recent results of V. Bakhtin, R. Oleinik, and the second named author that, given a metric space $\mathcal{X}$, a continuous map $\gamma\colon [a,b] \to \mathcal{X}$ is a map of bounded variation if and only if $f \circ…

Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…

We initiate a program of average smoothness analysis for efficiently learning real-valued functions on metric spaces. Rather than using the Lipschitz constant as the regularizer, we define a local slope at each point and gauge the function…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

A graph $G$ is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert +\left\vert E\left( G\right) \right\vert \right\}$ such…