相关论文: On the critical fugacity of the hard-core model on…
We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard-core model on bipartite expander graphs. Given a graph $G$ and $\lambda>0$, the hard-core model on $G$ at activity…
The hard-core model can be used to understand the numbers of independent sets in graphs in extremal graph theory. The occupancy fraction, defined as the logarithmic derivative of the independence polynomial of a graph, is a key quantity in…
We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…
We study a system of rods on the 2d square lattice, with hard-core exclusion. Each rod has a length between 2 and N. We show that, when N is sufficiently large, and for suitable fugacity, there are several distinct Gibbs states, with…
A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…
We establish long-range order for discrete nearest-neighbor spin systems on $\mathbb{Z}^d$ satisfying a certain symmetry assumption, when the dimension $d$ is higher than an explicitly described threshold. The results characterize all…
We consider the hard-core lattice gas model on Z^d and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds Cd^{-1/3}(log d)^2, the model exhibits multiple hard-core measures, thus improving…
Understanding the microscopic mechanism of coexisting long-range orders (such as lattice supersolidity) in strongly correlated systems is a subject of immense interest. We study the possible manifestations of long-range orders, including…
We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…
Using an extension of Pirogov-Sinai theory we prove phase transitions, corresponding to sublattice orderings, for a general class of hard core lattice particle systems with a finite number of close packed configurations. These include many…
We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest component is of order logarithmic in the number of vertices.…
We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…
We show that a point process of hard spheres exhibits long-range orientational order. This process is designed to be a random perturbation of a three-dimensional lattice that satisfies a specific rigidity property, examples include the FCC…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^d$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,\dots,…
We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…
In itinerant systems, electron-electron interactions may lead to the formation of local magnetic moments and their effective exchange coupling, which in turn gives rise to long-range magnetic order. Therefore, when moment formation is…
We consider the hard-core model on a finite square grid graph with stochastic Glauber dynamics parametrized by the inverse temperature $\beta$. We investigate how the transition between its two maximum-occupancy configurations takes place…
We study cluster sizes in supercritical $d$-dimensional inhomogeneous percolation models with long-range edges -- such as long-range percolation -- and/or heavy-tailed degree distributions -- such as geometric inhomogeneous random graphs…
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an…
Consider supercritical long-range percolation on $\Z^d$ where two vertices $x,y \in \Z^d$ are connected with probability asymptotic to $\|x-y\|^{-s}$ for some $s>2d$. Conditioned that the origin is in the infinite cluster, we prove a shape…