相关论文: Annealed limit theorems for the ising model on ran…

We present a sufficient condition for the presence of spontaneous magnetization for the Ising model on a general graph, related to its long-range topology. Applying this condition we are able to prove the existence of a phase transition at…

A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824-827].…

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

We prove annealed central limit theorems for finite pattern counts in the measurement record of discrete-time quantum trajectories generated by repeated measurements in a disordered environment. Under summable mixing assumptions on the…

A central limit theorem is proved for the free energy of the random field Ising model with all plus or all minus boundary condition, at any temperature (including zero temperature) and any dimension. This solves a problem posed by Wehr and…

In this paper we prove the existence of phase transitions at finite temperature for O(n) classical ferromagnetic spin models on infrared finite graphs. Infrared finite graphs are infinite graphs with $\lim {m\to 0^+} {\bar Tr (L+m)^{-1} <…

We simulate the Ising model on a set of fixed random $\phi^3$ graphs, which corresponds to a {\it quenched} coupling to 2D gravity rather than the annealed coupling that is usually considered. We investigate the critical exponents in such a…

We study the number of isolated vertices in a preferential attachment random graph introduced by Dereich and M\"orters in 2009. In this graph model vertices are added over time and newly arriving vertices connect to older ones with…

We prove quenched versions of a central limit theorem, a large deviations principle as well as a local central limit theorem for expanding on average cocycles. This is achieved by building an appropriate modification of the spectral method…

We study the percolation configuration arising from the random current representation of the near-critical Ising model on the complete graph. We compute the scaling limit of the cluster size distribution for an arbitrary set of sources in…

We prove that for each $d\geq 3$ and $k\geq 2$, the set of limit points of the first $k$ eigenvalues of sequences of $d$-regular graphs is \[ \{(\mu_1,\dots,\mu_k): d=\mu_1\geq \dots\geq \mu_{k}\geq2\sqrt{d-1}\}. \] The result for $k=2$ was…

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…

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 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 paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

The intent of this paper is to describe the large scale asymptotic geometry of iteration stable (STIT) tessellations in $\mathbb{R}^d$, which form a rather new, rich and flexible class of random tessellations considered in stochastic…

We derive the analytical expression for the first finite size correction to the average free energy of disordered Ising models on random regular graphs. The formula can be physically interpreted as a weighted sum over all non…

We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $\alpha$-stable laws and…

This is the first in a series of six articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. Many of…