Related papers: Functional central limit theorems for occupancies …
We consider a branching random walk on $d$-dimensional real space with immigration in a time-dependent random environment. Let $Z_n(\mathbf t)$ be the so-called partition function of the process, namely, the moment generating function of…
Using a central limit theorem for arrays of interacting quantum systems, we give analytical expressions for the density of states and the partition function at finite temperature of such a system, which are valid in the limit of infinite…
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…
In this paper, we prove maximal inequalities and study the functional central limit theorem for the partial sums of linear processes generated by dependent innovations. Due to the general weights, these processes can exhibit long-range…
Since the appearance of H. Robbins article (1948), the central limit theorems for random sums have been studied for about 70 years. The central limit theorems for random sums of independent random variables play a very important role in…
We propose an elementary but effective approach to studying a general class of Poissonized tenable and balanced urns on two colors. We characterize the asymptotic behavior of the process via a partial differential equation that governs the…
In this paper we consider a dynamic Erd\H{o}s-R\'{e}nyi random graph with independent identically distributed edge processes. Our aim is to describe the joint evolution of the entries of a subgraph count vector. The main result of this…
We obtain asymptotic accuracy of the poissonisation in the infinite occupancy scheme. All results are obtained for integer-valued random variables having a regularly varying distribution.
In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…
In this paper, we establish a central limit theorem for a large class of general supercritical superprocesses with spatially dependent branching mechanisms satisfying a second moment condition. This central limit theorem generalizes and…
We consider multicolor urn models with multiple drawings. An urn model is called linear if the conditional expected value of the urn composition at time $n$ is a linear function of the composition at time $n-1$. For four different sampling…
We review some facts, properties and applications of the urn of Hill, Lane and Sudderth, a paradigmatic model of stochastic process with memory where the urn evolution is as follows: consider an urn of given capacity, at each step a new…
The Central Limit Theorem provides a foundation for inferential statistics and hypothesis testing. It describes how standardized statistics behave under repeated sampling from large populations. However, if the size of the sample (n)…
We consider the Fleming--Viot particle system associated with a continuous-time Markov chain in a finite space. Assuming irreducibility, it is known that the particle system possesses a unique stationary distribution, under which its…
In this paper, we consider the occupancy distribution for an open network of infinite server queues with multivariate batch arrivals following a non-homogeneous Poisson process, and general service time distributions. We derive a…
We prove local central limit theorems for partial sums of the form \newline $\,S_n=\sum_{j=0}^{n-1}f_j\circ T_{j-1}\circ\cdots\circ T_1\circ T_0$ where $f_j$ are uniformly H\"older functions and $T_j$ are expanding maps. Using a symbolic…
We investigate branching processes in nearly degenerate varying environment, where the offspring distribution converges to the degenerate distribution at 1. Such processes die out almost surely, therefore, we condition on non-extinction or…
In this paper we study counting functions representing the number of solutions of systems of linear inequalities which arise in the theory of Diophantine approximation. We develop a method that allows us to explain the random-like behavior…
This is the second part of a two-part investigation. We continue the study of a class of balanced urn schemes on balls of two colors (white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn and ball addition rules…
Based on deleting-item central limit theory, the classical Donsker's theorem of partial-sum process of independent and identically distributed (i.i.d.) random variables is extended to incomplete partial-sum process. The incomplete…