Related papers: Height function localisation on trees

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…

We study gradient models for spins taking values in the integers (or an integer lattice), which interact via a general potential depending only on the differences of the spin values at neighboring sites, located on a regular tree with d + 1…

Height-offset variables (HOVs) provide a mechanism, known as "pinning at infinity", to lift gradient Gibbs measures (GGMs) - describing interface increments - to proper Gibbs measures that describe absolute heights. Starting from…

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…

Graph homomorphisms from the $\mathbb{Z}^d$ lattice to $\mathbb{Z}$ are functions on $\mathbb{Z}^d$ whose gradients equal one in absolute value. These functions are the height functions corresponding to proper $3$-colorings of…

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…

Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…

It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

In this paper we consider uniformly random lozenge tilings of arbitrary domains approximating (after suitable normalization) a closed, simply-connected subset of $\mathbb{R}^2$ with piecewise smooth, simple boundary. We show that the local…

We consider drawings of graphs in the plane in which vertices are assigned distinct points in the plane and edges are drawn as simple curves connecting the vertices and such that the edges intersect only at their common endpoints. There is…

We study Gibbsian models of unbounded integer-valued spins on trees which possess a symmetry under height-shift. We develop a theory relating boundary laws to gradient Gibbs measures, which applies also in cases where the corresponding…

We study random one-Lipschitz integer functions $f$ on the vertices of a finite connected graph, sampled according to the weight $W(f) = \prod_{\langle v, w \rangle \in E} \mathbf{c}^{ \mathbb{I} \{ f(v) = f(w) \} }$ where $\mathbf{c} \geq…

We investigate extremal statistical properties such as the maximal and the minimal heights of randomly generated binary trees. By analyzing the master evolution equations we show that the cumulative distribution of extremal heights…

We establish spectral and dynamical localization for several Anderson models on metric and discrete radial trees. The localization results are obtained on compact intervals contained in the complement of discrete sets of exceptional…

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

We prove empirical central limit theorems for the distribution of levels of various random fields defined on high-dimensional discrete structures as the dimension of the structure goes to $\infty$. The random fields considered include costs…

We show that the height function of the six-vertex model, in the parameter range $\mathbf a=\mathbf b=1$ and $\mathbf c\ge1$, is delocalized with logarithmic variance when $\mathbf c\le 2$. This complements the earlier proven localization…

A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on random regular graphs asymptotically until just…