Related papers: Central Limit Theorem in Disordered Monomer-Dimer …
We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…
This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
A collection of rigorous results for a class of mean-field monomer-dimer models is presented. It includes a Gaussian representation for the partition function that is shown to considerably simplify the proofs. The solutions of the quenched…
The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…
We prove a distributional limit theorem conjectured in [Journal of Statistical Physics 174, No. 6, 1372-1403 (2019)] for partition functions defining models of directed polymers on diamond hierarchical graphs with disorder variables placed…
The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…
We study the dimer model on the square grid, with quenched random edge weights. Randomness is chosen to have a layered structure, similar to that of the celebrated McCoy-Wu disordered Ising model. Disorder has a highly non-trivial effect…
On the 1+2 dimensional lattice, we consider a directed polymer in a random Gaussian environment that is independent in time and correlated in space. The spatial correlation is supposed to decay as $(\log |x|)^a /|x|^{2}$, $a>-1$, where the…
We consider Canonical Gibbsian ensembles of Euler point vortices on the 2-dimensional torus or in a bounded domain of R 2 . We prove that under the Central Limit scaling of vortices intensities, and provided that the system has zero global…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
We give general conditions for the central limit theorem and weak convergence to Brownian motion (the weak invariance principle / functional central limit theorem) to hold for observables of compact group extensions of nonuniformly…
We prove a Central Limit Theorem for the linear statistics of two-dimensional Coulomb gases, with arbitrary inverse temperature and general confining potential, at the macroscopic and mesoscopic scales and possibly near the boundary of the…
In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
We consider a general model of a disordered copolymer with adsorption. This includes, as particular cases, a generalization of the copolymer at a selective interface introduced by Garel et al. [Europhys. Lett. 8 (1989) 9--13], pinning and…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…