Related papers: Central limit theorems in the configuration model

We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…

The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…

The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…

Deep neural networks often generalize well despite heavy over-parameterization, challenging classical parameter-based analyses. We study generalization from a representation-centric perspective and analyze how the geometry of learned…

For martingales with a wide range of integrability, we will quantify the rate of convergence of the central limit theorem via Wasserstein distances of order $r$, $1\le r\le 3$. Our bounds are in terms of Lyapunov's coefficients and the…

In this article, we revisit the question of fluctuations of linear statistics of beta ensembles in the single cut and non-critical regime for general potentials $V$ under mild regularity and growth assumptions. Our main objective is to…

We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain…

In this work, we study the normal approximation and almost sure central limit theorems for some functionals of an independent sequence of Rademacher random variables. In particular, we provide a new chain rule that improves the one derived…

The purpose of this paper is to analyze the distribution distance between random vectors derived from the magnitude of the analytic wavelet transform of the squared envelopes of Gaussian processes and their large-scale limits. When the…

We consider the problem of optimal transportation with general cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We extend results in [19] and prove asymptotic stability of both optimal transport…

We prove the large-dimensional Gaussian approximation of a sum of $n$ independent random vectors in $\mathbb{R}^d$ together with fourth-moment error bounds on convex sets and Euclidean balls. We show that compared with classical…

The autocovariance and cross-covariance functions naturally appear in many time series procedures (e.g., autoregression or prediction). Under assumptions, empirical versions of the autocovariance and cross-covariance are asymptotically…

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…

A useful heuristic in the understanding of large random combinatorial structures is the Arratia-Tavare principle, which describes an approximation to the joint distribution of component-sizes using independent random variables. The…

This paper studies quantitative deviation bounds for statistical ensembles evolving under the one-parameter flow of a nearly integrable Hamiltonian system. Combining Nekhoroshev-type stability estimates with phase-mixing arguments, we…

The asymptotic normality of the Maximum Likelihood Estimator (MLE) is a long established result. Explicit bounds for the distributional distance between the distribution of the MLE and the normal distribution have recently been obtained for…

We develop approximate estimation methods for exponential random graph models (ERGMs), whose likelihood is proportional to an intractable normalizing constant. The usual approach approximates this constant with Monte Carlo simulations,…

In this note we outline a new and simple approach to proving central limit theorems for various 'global' graph parameters which have robust 'local' approximations, using the Efron--Stein inequality, which relies on a combinatorial analysis…

We study conditions under which treatment effect estimators constructed under the no-interference assumption in randomized experiments are asymptotically normal in the presence of interference. We prove that the standard Horvitz-Thompson…

We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $\Delta$ on $n$ vertices, for all $k \le (1-\delta)m^*(G)$, where $\delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an…