Related papers: Limit theorems with rate of convergence under subl…

Optimal transport has emerged as a fundamental methodology with applications spanning multiple research areas in recent years. However, the convergence rate of the empirical estimator to its population counterpart suffers from the curse of…

A law of large numbers and a central limit theorem are derived for linear statistics of random symmetric matrices whose on-or-above diagonal entries are independent, but neither necessarily identically distributed, nor necessarily all of…

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

We prove the conjectured limiting normality for the number of crossings of a uniformly chosen set partition of [n] = {1,2,...,n}. The arguments use a novel stochastic representation and are also used to prove central limit theorems for the…

We prove a central limit theorem for stationary multiple (random) fields of martingale differences $f\circ T_{\underline{i}}$, $\underline{i}\in \Bbb Z^d$, where $T_{\underline{i}}$ is a $\Bbb Z^d$ action. In most cases the multiple…

The study of high-dimensional distributions is of interest in probability theory, statistics and asymptotic convex geometry, where the object of interest is the uniform distribution on a convex set in high dimensions. The $\ell^p$ spaces…

We obtain some sufficient conditions for the Central Limit Theorem for the random processes (fields) with values in the separable part of Holder space in the modern terms of majorizing (minorizing) measures, belonging to X.Fernique and…

For a measure preserving transformation $T$ of a probability space $(X,\mathcal F,\mu)$ we investigate almost sure and distributional convergence of random variables of the form $$x \to \frac{1}{C_n} \sum_{i_1<n,...,i_d<n}…

The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…

In this work, we develop a numerical method to study the error estimates of the $\alpha$-stable central limit theorem under sublinear expectation with $\alpha \in(0,2)$, whose limit distribution can be characterized by a fully nonlinear…

We develop large sample theory for merged data from multiple sources. Main statistical issues treated in this paper are (1) the same unit potentially appears in multiple datasets from overlapping data sources, (2) duplicated items are not…

We prove limit theorems of an entirely new type for certain long memory regularly varying stationary infinitely divisible random processes. These theorems involve multiple phase transitions governed by how long the memory is. Apart from one…

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…

We prove a general normal approximation theorem for local graph statistics in the configuration model, together with an explicit bound on the error in the approximation with respect to the Wasserstein metric. Such statistics take the form…

This paper develops central limit theorems (CLT's) and large deviations results for additive functionals associated with reflecting diffusions in which the functional may include a term associated with the cumulative amount of boundary…

The angular bispectrum of spherical random fields has recently gained an enormous importance, especially in connection with statistical inference on cosmological data. In this paper, we provide expressions for its moments of arbitrary order…

Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in…

We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…

The Ewens-Pitman model defines a distribution on random partitions of $\{1,\ldots,n\}$, with parameters $\alpha \in [0,1)$ and $\theta > -\alpha$; the case $\alpha=0$ reduces to the classical Ewens model from population genetics. We…

Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…