Related papers: A central limit theorem for the matching number of…

In the seventies, Charles Stein revolutionized the way of proving the Central Limit Theorem by introducing a method that utilizes a characterization equation for Gaussian distribution. In the last 50 years, much research has been done to…

In this paper, we study the asymptotic behavior of a fully-coupled slow-fast McKean-Vlasov stochastic system. Using the non-linear Poisson equation on Wasserstein space, we first establish the strong convergence in the averaging principle…

We prove, for any $\beta >0$, a central limit theorem for the fluctuations of linear statistics in the Sine-$\beta$ process, which is the infinite volume limit of the random microscopic behavior in the bulk of one-dimensional log-gases at…

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…

The objective of this study is to investigate the limiting behavior of a subgraph counting process. The subgraph counting process we consider counts the number of subgraphs having a specific shape that exist outside an expanding ball as the…

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…

Central limit theorems for linear statistics of lattice random fields (including spin models) are usually proven under suitable mixing conditions or quasi-associativity. Many interesting examples of spin models do not satisfy mixing…

We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…

We consider a class of sparse random matrices which includes the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathcal{G}(N,p)$. We show that if $N^{\varepsilon} \leq Np \leq N^{1/3-\varepsilon}$ then all nontrivial eigenvalues away…

Szemer\'edi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R\"odl proved an analogue of Szemer\'edi's regularity lemma…

In 2010, Shiffman and Zelditch proved a central limit theorem (CLT) for smooth statistics of Gaussian random zeros in codimension one over compact K\"ahler manifolds. They raised the question of whether this result admits a two-fold…

The structure of very complicated irregular "microscopic" (local) entropy fluctuations around a big separated "macroscopic" (global) fluctuation in the statistical equilibrium was studied in numerical experiments on a simple 2--freedom…

The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…

We establish central limit theorems for a large class of supercritical branching Markov processes in infinite dimension with spatially dependent and non-necessarily local branching mechanisms. This result relies on a fourth moment…

We analyze Ising/Curie-Weiss models on the Erd\H{o}s-R\'enyi graph with $N$ vertices and edge probability $p=p(N)$ that were introduced by Bovier and Gayrard [J.\ Statist.\ Phys., 72(3-4):643--664, 1993] and investigated in two previous…

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…

Two landmark results in combinatorial random matrix theory, due to Koml\'os and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph…

Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…