Related papers: Concentration and central limit theorem for the av…

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…

In this article we consider L\'evy driven continuous time moving average processes observed on a lattice, which are stationary time series. We show asymptotic normality of the sample mean, the sample autocovariances and the sample…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

For a L\'evy basis $L$ on $\mathbb{R}^d$ and a suitable kernel function $f:\mathbb{R}^d \to \mathbb{R}$, consider the continuous spatial moving average field $X=(X_t)_{t\in \mathbb{R}^d}$ defined by $X_t = \int_{\mathbb{R}^d} f(t-s) \,…

We prove a central limit type theorem for critical marked Hawkes processes. We study the case where the marks are i.i.d. with nonnegative values and their common distribution is either heavy tailed or has finite variance. The kernel…

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…

This paper provides central limit theorems for the wavelet packet decomposition of stationary band-limited random processes. The asymptotic analysis is performed for the sequences of the wavelet packet coefficients returned at the nodes of…

We prove a functional limit theorem in a space of analytic functions for the random Dirichlet series $D(\alpha;z)=\sum_{n\geq 2}(\log n)^{\alpha}(\eta_n+{\rm i} \theta_n)/n^z$, properly scaled and normalized, where…

We study the central limit theorem in the non-normal domain of attraction to symmetric $\alpha$-stable laws for $0<\alpha\leq2$. We show that for i.i.d. random variables $X_i$, the convergence rate in $L^\infty$ of both the densities and…

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…

In this paper, we extend the central limit theorem of the occupation time of the voter model on the lattice $\mathbb{Z}^d$ given in \cite{Cox1983} to the sample path case for $d\geq 3$. The proof of our main result utilizes the resolvent…

Under the sublinear expectation $\mathbb{E}[\cdot]:=\sup_{\theta\in \Theta} E_\theta[\cdot]$ for a given set of linear expectations $\{E_\theta: \theta\in \Theta\}$, we establish a new law of large numbers and a new central limit theorem…

For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove…

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…

Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…

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…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…