Related papers: Central Limit Theorem for a P\'olya-Friedman Mixed…
The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…
Generalized Polya urn models can describe the dynamics of finite populations of interacting genotypes. Three basic questions these models can address are: Under what conditions does a population exhibit growth? On the event of growth, at…
We consider the general version of P\'olya urns recently studied by Bandyopadhyay and Thacker (2016+) and Mailler and Marckert (2017), with the space of colours being any Borel space $S$ and the state of the urn being a finite measure on…
Suppose you can color $n$ \emph{biased} coins with $n$ colors, all coins having the same bias. It is forbidden to color both sides of a coin with the same color, but all other colors are allowed. Let $X$ be the number of different colors…
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time \Theta(n^3 \log n) in the uniform case and time \Theta(n^2) in the constant…
The concept of individual admixture (IA) assumes that the genome of individuals is composed of alleles inherited from $K$ ancestral populations. Each copy of each allele has the same chance $q_k$ to originate from population $k$, and…
This paper is concerned with Spearman's correlation matrices under large dimensional regime, in which the data dimension diverges to infinity proportionally with the sample size. We establish the central limit theorem for the linear…
In a balls-in-bins process with feedback, balls are sequentially thrown into bins so that the probability that a bin with n balls obtains the next ball is proportional to f(n) for some function f. A commonly studied case where there are two…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…
We present a general approach to establish the Central Limit Theorem with error bounds for sequential dynamical systems. The main tool we develop is the application to this setting of a projective metric on complex cones, following the…
We study the competing urn model in which $m$ balls are placed independently into $n$ urns according to (possibly distinct) ball distributions. Kahn and Neiman (2010) showed that, under identical ball distributions, the induced urn measure…
The Pitman-Yor process is a random discrete measure. The random weights or masses follow the two-parameter Poisson-Dirichlet distribution with parameters $0<\alpha<1, \theta>-\alpha$. The parameters $\alpha$ and $\theta$ correspond to the…
An infinite urn scheme is defined by a probability mass function $(p_j)_{j\geq1}$ over positive integers. A random allocation consists of a sample of $N$ independent drawings according to this probability distribution where $N$ may be…
Concentration bounds are given for throwing balls into bins independently according to a distribution $p$. The probability of a $k$-loaded bin after $m$ balls is shown to be controlled on both sides by $\rho_{m,k} := m \|p\|_k / k$. This…
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,…
We study the joint asymptotics of forward and backward processes of numbers of non-empty urns in an infinite urn scheme. The probabilities of balls hitting the urns are assumed to satisfy the conditions of regular decrease. We prove weak…
For the interacting urn model with polynomial reinforcement, it has been conjectured that almost surely one color monopolizes all the urns if the interaction parameter $p>0$. We disprove the conjecture. For the case $p=1$, we give a…
We prove central limit theorems for the random walks on either the mapping class group of a closed, connected, orientable, hyperbolic surface, or on $\text{Out}(F_N)$, each time under a finite second moment condition on the measure (either…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
In this paper we prove a central limit theorem for some probability measures defined as asymtotic densities of integer sets defined via sum-of-digit-function. To any integer a we can associate a measure on Z called $\mu$a such that, for any…