Related papers: Decay of Correlations for the Hardcore Model on th…
We study the convergence properties of a collapsed Gibbs sampler for Bayesian vector autoregressions with predictors, or exogenous variables. The Markov chain generated by our algorithm is shown to be geometrically ergodic regardless of…
Gibbsian structure in random point fields has been a classical tool for studying their spatial properties. However, exact Gibbs property is available only in a relatively limited class of models, and it does not adequately address many…
We investigate the Gibbs-measures of ferromagnetically coupled continuous spins in double-well potentials subjected to a random field (our specific example being the $\phi^4$ theory), showing ferromagnetic ordering in $d\geq 3$ dimensions…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $\Delta$, a well-known computational phase transition occurs at the…
A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of balanced spanning trees in the random geometric graph…
The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its…
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…
We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
We study the computational complexity of estimating local observables for Gibbs distributions. A simple combinatorial example is the average size of an independent set in a graph. In a recent work, we established NP-hardness of…
In this paper, we study a class of multilinear Gibbs measures with Hamiltonian given by a generalized $\mathrm{U}$-statistic and with a general base measure. Expressing the asymptotic free energy as an optimization problem over a space of…
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…
We study the fixed-magnetization ferromagnetic Ising model on random $d$-regular graphs for $d\ge 3$ and inverse temperature below the tree reconstruction threshold. Our main result is that for each magnetization $\eta$, the free energy…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We study the thermodynamic formalism for generalized Gibbs measures, such as renormalization group transformations of Gibbs measures or joint measures of disordered spin systems. We first show existence of the relative entropy density and…
We prove Gibbs distribution of two-state spin systems(also known as binary Markov random fields) without hard constrains on a tree exhibits strong spatial mixing(also known as strong correlation decay), under the assumption that, for…
In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…
Random-scan Gibbs samplers possess a natural hierarchical structure. The structure connects Gibbs samplers targeting higher dimensional distributions to those targeting lower dimensional ones. This leads to a quasi-telescoping property of…