Related papers: Concentration and central limit theorem for the av…
We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than $\epsilon$ ($\epsilon$ > 0). Is is known ([BM05]) that the empirical measure of these fragments converges in law, under some…
Serfozo (2009, Theorem 2.65) gives a useful central limit theorem for processes with regenerative increments. Unfortunately, there is a gap in the proof. We fill this gap, and at the same time we weaken the assumptions. Furthermore, we give…
In this paper we present some new limit theorems for power variation of $k$th order increments of stationary increments L\'evy driven moving averages. In the infill asymptotic setting, where the sampling frequency converges to zero while…
We study cosmological polytopes induced by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These graph-based lattice polytopes form a natural model of random lattice polytopes in which geometric features are determined by the…
Let $(Z_n)$ be a supercritical branching process in a random environment $% \zeta$, and $W$ be the limit of the normalized population size $Z_n/\mathbb{E%}(Z_n|\zeta)$. We show necessary and sufficient conditions for the existence of…
Establishing central limit theorems (CLTs) for ergodic averages of Markov chains is a fundamental problem in probability and its applications. Since the seminal work~\cite{MR834478}, a vast literature has emerged on the sufficient…
Let (Z n) n$\ge$0 with Z n = (Z n (i, j)) 1$\le$i,j$\le$p be a p multi-type critical branching process in random environment, and let M n be the expectation of Z n given a fixed environment. We prove theorems on convergence in distribution…
A strengthened version of the central limit theorem for discrete random variables is established, relying only on information-theoretic tools and elementary arguments. It is shown that the relative entropy between the standardised sum of…
Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they…
Sourav Chatterjee, Persi Diaconis, Allan Sly and Lingfu Zhang, prompted by a question of Ramis Movassagh, renewed the study of a process proposed in the early 1980s by Jean Bourgain. A state vector $v \in \mathbb R^n$, labeled with the…
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a…
The intent of this paper is to describe the large scale asymptotic geometry of iteration stable (STIT) tessellations in $\mathbb{R}^d$, which form a rather new, rich and flexible class of random tessellations considered in stochastic…
When modelling metapopulation dynamics, the influence of a single patch on the metapopulation depends on the number of individuals in the patch. Since there is usually no obvious natural upper limit on the number of individuals in a patch,…
Ferromagnetic exponential random graph models (ERGMs) are nonlinear exponential tilts of Erd\H{o}s-R\'enyi models, under which the presence of certain subgraphs such as triangles may be emphasized. These models are mixtures of metastable…
We use a method developed by Bj\"orklund and Gorodnik to show a central limit theorem (as $T$ tends to $\infty$) for the counting functions $\# \left( \Lambda \cap \Omega_T \right)$ where $\Lambda$ ranges over the space $Y_{2d}$ of…
In this article, we study an interacting particle system in the context of epidemiology where the individuals (particles) are characterized by their position and infection state. We begin with a description at the microscopic level where…
We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…
The number of peaks of a random permutation is known to be asymptotically normal. We give a new proof of this and prove a central limit theorem for the distribution of peaks in a fixed conjugacy class of the symmetric group. Our technique…
In this article, we establish a central limit theorem for the capacity of the range process for a class of $d$-dimensional symmetric $\alpha$-stable random walks with the index satisfying $d > 5\alpha /2$. Our approach is based on…
Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…