Related papers: Central Limit Theorems for some Set Partition Stat…

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,…

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

We prove the asymptotic normality of the standardized number of crossings of a centered stationary mixing Gaussian process when both the level and the time horizon go to infinity in such a way that the expected number of crossings also goes…

We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…

In this talk I first review at an elementary level a selection of central limit theorems, including some lesser known cases, for sums and maxima of uncorrelated and correlated random variables. I recall why several of them appear in…

We establish a central limit theorem for the unnormalized linear statistic of the Gaussian Unitary Ensemble under optimal conditions: the linear statistics converges if and only if the expression for the limiting variance is finite.

General Central limit theorem deals with weak limits (in type) of sums of row-elements of array random variables. In some situations as in the invariance principle problem, the sums may include only parts of the row-elements. For strictly…

This paper establishes a combinatorial central limit theorem for stratified randomization, which holds under a Lindeberg-type condition. The theorem allows for an arbitrary number or sizes of strata, with the sole requirement being that…

We prove a central limit theorem for random walks with finite variance on linear groups.

In Part I of this article (Banerjee and Kuchibhotla (2023)), we have introduced a new method to bound the difference in expectations of an average of independent random vector and the limiting Gaussian random vector using level sets. In the…

We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…

In this paper, we study almost sure central limit theorems for multiple stochastic integrals and provide a criterion based on the kernel of these multiple integrals. We apply our result to normalized partial sums of Hermite polynomials of…

We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\sum_{j=0}^{N}p_jz^j$…

In this paper we establish spatial central limit theorems for a large class of supercritical branching Markov processes with general spatial-dependent branching mechanisms. These are generalizations of the spatial central limit theorems…

We study the asymptotic distribution of the two following combinatorial parameters: the number of arc crossings in the linear representation, ${\mathrm cr^{(\ell)}$, and the number of chord crossings in the circular representation,…

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.