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

We study a model in which p independent Ising spins are coupled to 2d quantum gravity (in the form of dynamical planar phi-cubed graphs). Consideration is given to the p tends to infinity limit in which the partition function becomes…

We consider the two- (2D) and three-dimensional (3D) Ising model on a square lattice at the critical temperature $T_c$, under Monte-Carlo spin flip dynamics. The bulk magnetisation and the magnetisation of a tagged line in the 2D Ising…

Using Monte Carlo simulations we study the Ising model with spin S=1/2 and 1 on {\it directed} and {\it undirected} Erd\"os-R\'enyi (ER) random graphs, with $z$ neighbors for each spin. In the case with spin S=1/2, the {\it undirected} and…

The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…

The spontaneous magnetization is proved to vanish continuously at the critical temperature for a class of ferromagnetic Ising spin systems which includes the nearest neighbor ferromagnetic Ising spin model on $\mathbb Z^d$ in $d=3$…

An analysis of the random lattice gas in the annealed limit is presented. The statistical mechanics of disordered lattice systems is briefly reviewed. For the case of the lattice gas with an arbitrary uniform interaction potential and…

The central limit theorem is, with the strong law of large numbers, one of the two fundamental limit theorems in probability theory. Benjamin Jourdain and Alvin Tse have extended to non-linear functionals of the empirical measure of…

The one-dimensional Ising model in an external magnetic field with uniform long-range interactions and random short-range interactions satisfying bimodal annealed distributions is studied. This generalizes the random model discussed by…

We consider the spectral properties of a class of regularized estimators of (large) empirical covariance matrices corresponding to stationary (but not necessarily Gaussian) sequences, obtained by banding. We prove a law of large numbers…

We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…

In this paper, under mild assumptions, we derive a law of large numbers, a central limit theorem with an error estimate, an almost sure invariance principle and a variant of Chernoff bound in finite-state hidden Markov models. These limit…

This article is concerned with the asymptotic behaviour of random vectors in a diluted ferromagnetic model. We consider a model introduced by Bovier & Gayrard (1993) with ferromagnetic interactions on a directed Erd\H{o}s-R\'enyi random…

Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameters $d_1 \leq d_2$, there exists a coupling of $G(n,d_1)$ and…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the…

The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…