Related papers: Uniqueness of Gibbs Measures for Continuous Hardco…

In zero-temperature Glauber dynamics, vertices of a graph are given i.i.d.~initial spins $\sigma_x(0)$ from $\{-1,+1\}$ with $\mathbb{P}_p(\sigma_x(0) = +1)=p$, and they update their spins at the arrival times of i.i.d. Poisson processes to…

We present novel results for fast mixing of Glauber dynamics using the newly introduced and powerful Spectral Independence method from [Anari, Liu, Oveis-Gharan: FOCS 2020]. In our results, the parameters of the Gibbs distribution are…

Consider a sequence of Gibbsian line ensembles, whose lowest labeled curves (i.e., the edge) have tight one-point marginals. Then, given certain technical assumptions on the nature of the Gibbs property and underlying random walk measure,…

We study the structure of invariant measures for continuous automorphisms of compact metrizable abelian groups satisfying the descending chain condition. We show that the finitely supported invariant measures are weak-* dense in the space…

We study a classical integrable (Neumann) model describing the motion of a particle on the sphere, subject to harmonic forces. We tackle the problem in the infinite dimensional limit by introducing a soft version in which the spherical…

We define a potential-weighted connective constant that measures the effective strength of a repulsive pair potential of a Gibbs point process modulated by the geometry of the underlying space. We then show that this definition leads to…

Given a graph $G$, the hard-core model defines a probability distribution over its independent sets, assigning to each set of size $k$ a probability of $\frac{\lambda^k}{Z}$, where $\lambda>0$ is a parameter known as the \emph{fugacity} and…

Twin-width is a recently introduced graph parameter based on the repeated contraction of near-twins. It has shown remarkable utility in algorithmic and structural graph theory, as well as in finite model theory -- particularly since…

We prove that the set of automorphism invariant Gibbs measures for the $\varphi^4$ model on graphs of polynomial growth has at most two extremal measures at all values of $\beta$. We also give a sufficient condition to ensure that the set…

We consider general classes of gradient models on regular trees with values in a countable Abelian group $S$ such as $\mathbb{Z}$ or $\mathbb{Z}_q$, in regimes of strong coupling (or low temperature). This includes unbounded spin models…

We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

Let us consider the local specification system of Gibbs point process with inhib ition pairwise interaction acting on some Delaunay subgraph specifically not con taining the edges of Delaunay triangles with circumscribed circle of radius…

We study dense packings of disks and related Gibbs distributions representing high-density phases in the hard-core model on unit triangular, honeycomb and square lattices. The model is characterized by a Euclidean exclusion distance $D>0$…

We consider a countable system of interacting (possibly non-Markovian) stochastic differential equations driven by independent Brownian motions and indexed by the vertices of a locally finite graph $G = (V,E)$. The drift of the process at…

We consider two versions of random gradient models. In model A the interface feels a bulk term of random fields while in model B the disorder enters through the potential acting on the gradients. It is well known that for gradient models…

The paper concerns the $q$-state Potts model (i.e., with spin values in $\{1,\dots,q\}$) on a Cayley tree $\mathbb{T}^k$ of degree $k\geq 2$ (i.e., with $k+1$ edges emanating from each vertex) in an external (possibly random) field. We…

In this paper, we want to clarify the Gibbs phenomenon when continuous and discontinuous finite elements are used to approximate discontinuous or nearly discontinuous PDE solutions from the approximation point of view. For a simple step…

We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…