Related papers: Logarithmic delocalization of random Lipschitz fun…
The interest is in models of integer-valued height functions on shift-invariant planar graphs whose maximum degree is three. We prove delocalisation for models induced by convex nearest-neighbour potentials, under the condition that each…
This work studies the typical behavior of random integer-valued Lipschitz functions on expander graphs with sufficiently good expansion. We consider two families of functions: M-Lipschitz functions (functions that change by at most M along…
We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…
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 study the fluctuations of random surfaces on a two-dimensional discrete torus. The random surfaces we consider are defined via a nearest-neighbor pair potential which we require to be twice continuously differentiable on a (possibly…
Benjamini, Yadin, and Yehudayoff (2007) showed that if the maximum degree of a graph $G$ is 'sub-logarithmic,' then the typical range of random $\mathbb Z$-homomorphisms is super-constant. Furthermore, they showed that there is a sharp…
A grounded M-Lipschitz function on a rooted d-ary tree is an integer-valued map on the vertices that changes by at most along edges and attains the value zero on the leaves. We study the behavior of such functions, specifically, their…
$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\mathbb{Z}$. For $M \in \N$, an \emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping…
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 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 consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…
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…
A homomorphism height function on the $d$-dimensional torus $\mathbb{Z}_n^d$ is a function taking integer values on the vertices of the torus with consecutive integers assigned to adjacent vertices. A Lipschitz height function is defined…
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…
We observe that embeddings into random metrics can be fruitfully used to study the $L_1$-embeddability of lamplighter graphs or groups, and more generally lamplighter metric spaces. Once this connection has been established, several new…
Motivated by connections to random matrices, Littlewood-Richardson coefficients and tilings, we study random discrete concave functions on an equilateral lattice. We show that such functions having a periodic Hessian of a fixed average…
We study a model of random surfaces arising in the dimer model on the honeycomb lattice. For a fixed ``wire frame'' boundary condition, as the lattice spacing $\epsilon\to0$, Cohn, Kenyon and Propp [CKP] showed the almost sure convergence…
We consider the 2D Hubbard model on the honeycomb lattice, as a model for a single layer graphene sheet in the presence of screened Coulomb interactions. At half filling and weak enough coupling, we compute the free energy, the ground state…
We study local filters for the Lipschitz property of real-valued functions $f: V \to [0,r]$, where the Lipschitz property is defined with respect to an arbitrary undirected graph $G=(V,E)$. We give nearly optimal local Lipschitz filters…
Tackling semi-supervised learning problems with graph-based methods has become a trend in recent years since graphs can represent all kinds of data and provide a suitable framework for studying continuum limits, e.g., of differential…