Related papers: Berry-Esseen-type estimates for random variables w…
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…
Homogeneous normalized random measures with independent increments (hNRMIs) represent a broad class of Bayesian nonparametric priors and thus are widely used. In this paper, we obtain the strong law of large numbers, the central limit…
In order to characterize the fluctuation between the ergodic limit and the time-averaging estimator of a full discretization in a quantitative way, we establish a central limit theorem for the full discretization of the parabolic stochastic…
Exact upper bounds on the Winsorised-tilted mean of a random variable in terms of its first two moments are given. Such results are needed in work on nonuniform Berry--Esseen-type bounds for general nonlinear statistics. As another…
We establish a finite-sample Berry-Esseen theorem for the entrywise limits of the eigenvectors for a broad collection of signal-plus-noise random matrix models under challenging weak signal regimes. The signal strength is characterized by a…
Let $Z:=\{Z_t,t\geq0\}$ be a stationary Gaussian process. We study two estimators of $\mathbb{E}[Z_0^2]$, namely $\widehat{f}_T(Z):= \frac{1}{T} \int_{0}^{T} Z_{t}^{2}dt$, and $\widetilde{f}_n(Z) :=\frac{1}{n} \sum_{i =1}^{n}…
To learn (statistical) dependencies among random variables requires exponentially large sample size in the number of observed random variables if any arbitrary joint probability distribution can occur. We consider the case that sparse data…
Sparse graphs with bounded average degree form a rich class of discrete structures where local geometry strongly influences global behavior. The Benjamini-Schramm (BS) convergence offers a natural framework to describe their asymptotic…
A powerful robust mean estimator introduced by Catoni (2012) allows for mean estimation of heavy-tailed data while achieving the performance characteristics of classical mean estimator for sub-Gaussian data. While Catoni's framework has…
Let {F_n} be a normalized sequence of random variables in some fixed Wiener chaos associated with a general Gaussian field, and assume that E[F_n^4] --> E[N^4]=3, where N is a standard Gaussian random variable. Our main result is the…
Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model when the number of vertices goes to infinity. By approximating the inverse of the Fisher information matrix, we…
We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…
For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…
We prove a central limit theorem for linear triangular arrays under weak dependence conditions. Our result is then applied to the study of dependent random variables sampled by a $\bbZ$-valued transient random walk. This extends the results…
We obtain a Bernstein-type inequality for sums of Banach-valued random variables satisfying a weak dependence assumption of general type and under certain smoothness assumptions of the underlying Banach norm. We use this inequality in order…
We establish a Cram\'er-type moderate deviation theorem for double-index permutation statistics (DIPS). To the best of our knowledge, previous results only provided Berry-Esseen type bounds for DIPS, which cannot yield moderate deviation…
Given a weakly dependent stationary process, we describe the transition between a Berry-Esseen bound and a second order Edgeworth expansion in terms of the Berry-Esseen characteristic. This characteristic is sharp: We show that Edgeworth…
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…
In this paper, quantitative central limit theorems for $U$-statistics on the $q$-dimensional torus defined in the framework of the two-sample problem for Poisson processes are derived. In particular, the $U$-statistics are built over tight…
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…