相关论文: Delocalization of uniform graph homomorphisms from…

We show that a modification of the proof of our paper [CvELNR18], in the spirit of [FP81], shows delocalisation in the long-range Discrete Gaussian Chain, and generalisations thereof, for any decay power $\alpha>2$ and at all temperatures.…

We study two models of discrete height functions, that is, models of random integer-valued functions on the vertices of a tree. First, we consider the random homomorphism model, in which neighbours must have a height difference of exactly…

In this article, we prove that the height function associated with the square-ice model (i.e.~the six-vertex model with $a=b=c=1$ on the square lattice), or, equivalently, of the uniform random homomorphisms from $\mathbb Z^2$ to $\mathbb…

We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…

The solid-on-solid model is a model of height functions, introduced to study the interface separating the $+$ and $-$ phase in the Ising model. The planar solid-on-solid model thus corresponds to the three-dimensional Ising model.…

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…

We prove that the height function associated with the uniform six-vertex model (or equivalently, the uniform homomorphism height function from $\mathbb Z^2$ to $\mathbb Z$) satisfies a central limit theorem, upon some logarithmic rescaling.

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…

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…

We study gauging interfaces and their defect descendants in lattice models with generalized symmetries in higher dimensions. We construct explicit interface Hamiltonians for gauging a $\mathbb Z_2^{(0)}$ symmetry in $(2+1)d$ and a $\mathbb…

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…

We consider gradient models on the lattice $Z^d$. These models serve as effective models for interfaces and are also known as continuous Ising models. The height of the interface is modelled by a random field with an energy which is a…

We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…

We consider the unique measure of maximal entropy for proper 3-colorings of $\mathbb{Z}^2$, or equivalently, the so-called zero-slope Gibbs measure. Our main result is that this measure is Bernoulli, or equivalently, that it can be…

We study the extremal process associated with the Discrete Gaussian Free Field on the square lattice and elucidate how the conformal symmetries manifest themselves in the scaling limit. Specifically, we prove that the joint process of…

A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…

Given a countable graph $\mathcal{G}$ and a finite graph $\mathrm{H}$, we consider $\mathrm{Hom}(\mathcal{G},\mathrm{H})$ the set of graph homomorphisms from $\mathcal{G}$ to $\mathrm{H}$ and we study Gibbs measures supported on…

A graph homomorphism from the rooted $d$-branching tree $\phi: T^d \to H$ is said to be cold if the values of $\phi$ for vertices arbitrarily far away from the root can restrict the value of $\phi$ at the root. Warmth is a graph parameter…

A homogenization problem of infinite dimensional diffusion processes indexed by ${\mathbf Z}^d$ having periodic drift coefficients is considered. By an application of the uniform ergodic theorem for infinite dimensional diffusion processes…