Related papers: Local limit theorems for subgraph counts

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…

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 consider the adjacency matrix $A$ of a large random graph and study fluctuations of the function $f_n(z,u)=\frac{1}{n}\sum_{k=1}^n\exp\{-uG_{kk}(z)\}$ with $G(z)=(z-iA)^{-1}$. We prove that the moments of fluctuations normalized by…

We present a new approach to graph limit theory which unifies and generalizes the two most well developed directions, namely dense graph limits (even the more general $L^p$ limits) and Benjamini--Schramm limits (even in the stronger…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…

The colored neighborhood metric for sparse graphs was introduced by Bollob\'as and Riordan. The corresponding convergence notion refines a convergence notion introduced by Benjamini and Schramm. We prove that even in this refined sense, the…

We propose a new proof technique that aims to be applied to the same problems as the Lov\'asz Local Lemma or the entropy-compression method. We present this approach in the context of non-repetitive colorings and we use it to improve…

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…

In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asymptotic formulae for the number of connected $r$-uniform…

We prove a local limit theorem, i.e. a central limit theorem for densities, for a sequence of independent and identically distributed random variables taking values on an abstract Wiener space; the common law of those random variables is…

Concentration inequalities for subgraph counts in random geometric graphs built over Poisson point processes are proved. The estimates give upper bounds for the probabilities $\mathbb{P}(N\geq M +r)$ and $\mathbb{P}(N\leq M - r)$ where $M$…

We generalize ultraproducts and local-global limits of graphs to hypergraphs and other structures. We show that the local statistics of an ultraproduct of a sequence of hypergraphs are the ultralimits of the local statistics of the…

We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply…

In this paper we consider two-opinion voter models on dynamic random graphs, in which the joint dynamics of opinions and graphs acts as one-way feedback, i.e., edges appear and disappear over time depending on the opinions of the two…

We address the issue of the Central Limit Theorem for (both local and global) empirical measures of diffusions interacting on a possibly diluted Erd\H{o}s-R\'enyi graph. Special attention is given to the influence of initial condition (not…

In this note we consider a more general version of local sparsity introduced recently by Anderson, Kuchukova, and the author. In particular, we say a graph $G = (V, E)$ is $(k, r)$-locally-sparse if for each vertex $v \in V(G)$, the…

In this paper, we study the superconvergence phenomenon in the free central limit theorem for identically distributed, unbounded summands. We prove not only the uniform convergence of the densities to the semicircular density but also their…

This paper investigates a local central limit theorem for a normalized sequence of random variables belonging to a fixed order Wiener chaos and converging to the standard normal distribution. We prove, without imposing any additional…