Related papers: A functional central limit theorem for a class of …

This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…

We define the local empirical process, based on $n$ i.i.d. random vectors in dimension $d$, in the neighborhood of the boundary of a fixed set. Under natural conditions on the shrinking neighborhood, we show that, for these local empirical…

We prove a functional central limit theorem for subgraph counts in a dynamic version of the random connection model. To establish tightness, we develop a dynamic extension of the cumulant method.

Using an averaged generating function for coloured hard-dimers, some random variables of interest are studied. The main result lies in the fact that all their probability distributions obey a central limit theorem.

We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by…

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 study first order linear partial differential equations that appear, for example, in the analysis of dimishing urn models with the help of the method of characteristics and formulate sufficient conditions for a central limit theorem.

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…

We consider Betti numbers of the excursion of a smooth Euclidean Gaussian field restricted to a rectangular window, in the asymptotics where the window grows to R^d . With motivations coming from Topological Data Analysis, we derive a…

The generalized P\`olya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in…

We establish a central limit theorem (CLT) for families of products of $\epsilon$-independent random variables. We utilize graphon limits to encode the evolution of independence and characterize the limiting distribution. Our framework…

The objective of this study is to investigate the limiting behavior of a subgraph counting process. The subgraph counting process we consider counts the number of subgraphs having a specific shape that exist outside an expanding ball as the…

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…

Local limit theorems are derived for the number of occupied urns in general finite and infinite urn models under the minimum condition that the variance tends to infinity. Our results represent an optimal improvement over previous ones for…

An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number…

Let $(X_i,i\geq 1)$ be a sequence of i.i.d. random variables with values in $[0,1]$, and $f$ be a function such that $`E(f(X_1)^2)<+\infty$. We show a functional central limit theorem for the process $t\mapsto \sum_{i=1}^n f(X_i)1_{X_i\leq…

Under certain mild conditions, limit theorems for additive functionals of some $d$-dimensional self-similar Gaussian processes are obtained. These limit theorems work for general Gaussian processes including fractional Brownian motions,…

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…

By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…

We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.