We study the locations of complex zeroes of independence polynomials of bounded-degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical physics, algorithms, and combinatorics. Results on zero-free regions for bounded-degree graphs include Shearer’s result on the optimal zero-free disc, along with several recent results on other zero-free regions. Much less is known for hypergraphs. We make some steps towards an understanding of zero-free regions for bounded-degree hypergaphs by proving that all hypergraphs of maximum degree $\Delta$ have a zero-free disc almost as large as the optimal disc for graphs of maximum degree $\Delta$ established by Shearer (of radius $\sim 1/(e \Delta )$). Up to logarithmic factors in $\Delta$ this is optimal, even for hypergraphs with all edge sizes strictly greater than $2$. We conjecture that for $k\ge 3$, $k$-uniform linear hypergraphs have a much larger zero-free disc of radius $\Omega (\Delta ^{- \frac{1}{k-1}} )$. We establish this in the case of linear hypertrees.

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 one. The local law is uniform by definition. We prove that the height variance of this model is bounded, uniformly over all boundary conditions (both in terms of location and boundary heights). This implies a strong notion of localisation, uniformly over all extremal Gibbs measures of the system. For the second model, we consider directed trees, in which each vertex has exactly one parent and at least two children. We consider the locally uniform law on height functions which are monotone, that is, such that the height of the parent vertex is always at least the height of the child vertex. We provide a complete classification of all extremal gradient Gibbs measures, and describe exactly the localisation-delocalisation transition for this model. Typical extremal gradient Gibbs measures are localised also in this case. Localisation in both models is consistent with the observation that the Gaussian free field is localised on trees, which is an immediate consequence of transience of the random walk.

The total energy of an eigenstate in a composite quantum system tends to be distributed equally among its constituents. We identify the quantum fluctuation around this equipartition principle in the simplest disordered quantum system consisting of linear combinations of Wigner matrices. As our main ingredient, we prove the Eigenstate Thermalisation Hypothesis and Gaussian fluctuation for general quadratic forms of the bulk eigenvectors of Wigner matrices with an arbitrary deformation.

We consider Poisson hail models and characterize up to boundaries the collection of critical moments which guarantee stability. In particular, we treat the case of infinite speed of propagation.

We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a stable potential. This result holds for all activities $\lambda$ for which the partition function satisfies a zero-free assumption in a neighbourhood of the interval $[0,\lambda ]$. As a corollary, for all finiterange stable potentials, we obtain a quasipolynomial-time deterministic algorithm for all $\lambda \lt 1/(e^{B + 1} \hat C_\phi )$ where $\hat C_\phi$ is a temperedness parameter and $B$ is the stability constant of $\phi$. In the special case of a repulsive potential such as the hard-sphere gas we improve the range of activity by a factor of at least $e^2$ and obtain a quasipolynomial-time deterministic approximation algorithm for all $\lambda \lt e/\Delta _\phi$, where $\Delta _\phi$ is the potential-weighted connective constant of the potential $\phi$. Our algorithm approximates coefficients of the cluster expansion of the partition function and uses the interpolation method of Barvinok to extend this approximation throughout the zero-free region.

We introduce a formula for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate of lattice animals $a(G)$ and vice versa. We exploit this in both directions. We obtain the rigorous lower bound ${\dot{p}_c}({\mathbb{Z}}^3)\gt 0.2522$ for 3-dimensional site percolation. We also improve on the best known asymptotic bounds on $a({\mathbb{Z}}^d)$ as $d\to \infty$. Our formula remains valid if instead of lattice animals we enumerate certain subspecies called interfaces. Enumerating interfaces leads to functional duality formulas that are tightly connected to percolation and are not valid for lattice animals, as well as to strict inequalities for the percolation threshold.

Incidentally, we prove that the rate of the exponential decay of the cluster size distribution of Bernoulli percolation is a continuous function of $p\in (0,1)$.

We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e. two particles are interacting if and only if they are connected in the underlying graph. We establish a law of large numbers for the empirical measure of the system that holds whenever the graph sequence is convergent to a graphon. The limit is the solution of a non-linear Fokker–Planck equation weighted by the (possibly random) graphon limit. In contrast with the existing literature, our analysis focuses on both deterministic and random graphons: no regularity assumptions are made on the graph limit and we are able to include general graph sequences such as exchangeable random graphs. Finally, we identify the sequences of graphs, both random and deterministic, for which the associated empirical measure converges to the classical McKean–Vlasov mean-field limit.

We consider the simple random walk on the d-dimensional lattice $\mathbb{Z}^d$ ( $d \geq 1$ ), traveling in potentials which are Bernoulli-distributed. The so-called Lyapunov exponent describes the cost of traveling for the simple random walk in the potential, and it is known that the Lyapunov exponent is strictly monotone in the parameter of the Bernoulli distribution. Hence the aim of this paper is to investigate the effect of the potential on the Lyapunov exponent more precisely, and we derive some Lipschitz-type estimates for the difference between the Lyapunov exponents.

Given a locally finite graph $\Gamma $ , an amenable subgroup G of graph automorphisms acting freely and almost transitively on its vertices, and a G-invariant activity function $\unicode{x3bb} $ , consider the free energy $f_G(\Gamma ,\unicode{x3bb} )$ of the hardcore model defined on the set of independent sets in $\Gamma $ weighted by $\unicode{x3bb} $ . Under the assumption that G is finitely generated and its word problem can be solved in exponential time, we define suitable ensembles of hardcore models and prove the following: if $\|\unicode{x3bb} \|_\infty < \unicode{x3bb} _c(\Delta )$ , there exists a randomized $\epsilon $ -additive approximation scheme for $f_G(\Gamma ,\unicode{x3bb} )$ that runs in time $\mathrm {poly}((1+\epsilon ^{-1})\lvert \Gamma /G \rvert )$ , where $\unicode{x3bb} _c(\Delta )$ denotes the critical activity on the $\Delta $ -regular tree. In addition, if G has a finite index linearly ordered subgroup such that its algebraic past can be decided in exponential time, we show that the algorithm can be chosen to be deterministic. However, we observe that if $\|\unicode{x3bb} \|_\infty> \unicode{x3bb} _c(\Delta )$ , there is no efficient approximation scheme, unless $\mathrm {NP} = \mathrm {RP}$ . This recovers the computational phase transition for the partition function of the hardcore model on finite graphs and provides an extension to the infinite setting. As an application in symbolic dynamics, we use these results to develop efficient approximation algorithms for the topological entropy of subshifts of finite type with enough safe symbols, we obtain a representation formula of pressure in terms of random trees of self-avoiding walks, and we provide new conditions for the uniqueness of the measure of maximal entropy based on the connective constant of a particular associated graph.

Two ensembles are frequently used to model random graphs subject to constraints: the microcanonical ensemble (= hard constraint) and the canonical ensemble (= soft constraint). It is said that breaking of ensemble equivalence (BEE) occurs when the specific relative entropy of the two ensembles does not vanish as the size of the graph tends to infinity. Various examples have been analysed in the literature. It was found that BEE is the rule rather than the exception for two classes of constraints: sparse random graphs when the number of constraints is of the order of the number of vertices, and dense random graphs when there are two or more constraints that are frustrated. We establish BEE for a third class: dense random graphs with a single constraint on the density of a given simple graph. We show that BEE occurs in a certain range of choices for the density and the number of edges of the simple graph, which we refer to as the BEE-phase. We also show that, in part of the BEE-phase, there is a gap between the scaling limits of the averages of the maximal eigenvalue of the adjacency matrix of the random graph under the two ensembles, a property that is referred to as the spectral signature of BEE. We further show that in the replica symmetric region of the BEE-phase, BEE is due to the coexistence of two densities in the canonical ensemble.

Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb{H}^d$ in such a way that it admits a transitive action by isometries of $\mathbb{H}^d$ . Let $p_{\text{a}}$ be the supremum of all percolation parameters such that no point at infinity of $\mathbb{H}^d$ lies in the boundary of the cluster of a fixed vertex with positive probability. Then for any parameter $p < p_{\text{a}}$ , almost surely every percolation cluster is thin-ended, i.e. has only one-point boundaries of ends.

We give an example of an FIID vertex-labeling of ${\mathbb T}_3$ whose marginals are uniform on $[0,1]$ , and if we delete the edges between those vertices whose labels are different, then some of the remaining clusters are infinite. We also show that no such process can be finitary.

We consider supercritical site percolation on the $d$ -dimensional hypercube $Q^d$ . We show that typically all components in the percolated hypercube, besides the giant, are of size $O(d)$ . This resolves a conjecture of Bollobás, Kohayakawa, and Łuczak from 1994.

We study Bose gases in $d \ge 2$ dimensions with short-range repulsive pair interactions at positive temperature, in the canonical ensemble and in the thermodynamic limit. We assume the presence of hard Poissonian obstacles and focus on the non-percolation regime. For sufficiently strong interparticle interactions, we show that almost surely there cannot be Bose–Einstein condensation into a sufficiently localized, normalized one-particle state. The results apply to the canonical eigenstates of the underlying one-particle Hamiltonian.

We show that the $4$ -state anti-ferromagnetic Potts model with interaction parameter $w\in (0,1)$ on the infinite $(d+1)$ -regular tree has a unique Gibbs measure if $w\geq 1-\dfrac{4}{d+1_{_{\;}}}$ for all $d\geq 4$ . This is tight since it is known that there are multiple Gibbs measures when $0\leq w\lt 1-\dfrac{4}{d+1}$ and $d\geq 4$ . We moreover give a new proof of the uniqueness of the Gibbs measure for the $3$ -state Potts model on the $(d+1)$ -regular tree for $w\geq 1-\dfrac{3}{d+1}$ when $d\geq 3$ and for $w\in (0,1)$ when $d=2$ .

We investigate expansions for connectedness functions in the random connection model of continuum percolation in powers of the intensity. Precisely, we study the pair-connectedness and the direct-connectedness functions, related to each other via the Ornstein–Zernike equation. We exhibit the fact that the coefficients of the expansions consist of sums over connected and 2-connected graphs. In the physics literature, this is known to be the case more generally for percolation models based on Gibbs point processes and stands in analogy to the formalism developed for correlation functions in liquid-state statistical mechanics.

We find a representation of the direct-connectedness function and bounds on the intensity which allow us to pass to the thermodynamic limit. In some cases (e.g., in high dimensions), the results are valid in almost the entire subcritical regime. Moreover, we relate these expansions to the physics literature and we show how they coincide with the expression provided by the lace expansion.

We construct coloured lattice models whose partition functions represent symplectic and odd orthogonal Demazure characters and atoms. We show that our lattice models are not solvable, but we are able to show the existence of sufficiently many solutions of the Yang–Baxter equation that allow us to compute functional equations for the corresponding partition functions. From these functional equations, we determine that the partition function of our models are the Demazure atoms and characters for the symplectic and odd orthogonal Lie groups. We coin our lattice models as quasi-solvable. We use the natural bijection of admissible states in our models with Proctor patterns to give a right key algorithm for reverse King tableaux and Sundaram tableaux.

We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on n vertices with minimal degree linear in n is typically of order $\sqrt{n}$ . A byproduct of our proof, which is of independent interest, is that on such graphs the Cheeger constant and the spectral gap are comparable.

In this text, we provide a fully rigorous and complete proof of E.H. Lieb’s statement that (topological) entropy of square ice (or six-vertex model, XXZ spin chain for anisotropy parameter $\Delta =1/2$ ) is equal to $\tfrac 32\log _{2} (4/3)$ .

Signal-to-interference-plus-noise ratio (SINR) percolation is an infinite-range dependent variant of continuum percolation modeling connections in a telecommunication network. Unlike in earlier works, in the present paper the transmitted signal powers of the devices of the network are assumed random, independent and identically distributed, and possibly unbounded. Additionally, we assume that the devices form a stationary Cox point process, i.e., a Poisson point process with stationary random intensity measure, in two or more dimensions. We present the following main results. First, under suitable moment conditions on the signal powers and the intensity measure, there is percolation in the SINR graph given that the device density is high and interferences are sufficiently reduced, but not vanishing. Second, if the interference cancellation factor $\gamma$ and the SINR threshold $\tau$ satisfy $\gamma \geq 1/(2\tau)$ , then there is no percolation for any intensity parameter. Third, in the case of a Poisson point process with constant powers, for any intensity parameter that is supercritical for the underlying Gilbert graph, the SINR graph also percolates with some small but positive interference cancellation factor.