Related papers: Entropic CLT for Order Statistics

For $k,m,n\in \mathbb{N}$, we consider $n^k\times n^k$ random matrices of the form $$ \mathcal{M}_{n,m,k}(\mathbf{y})=\sum_{\alpha=1}^m\tau_\alpha {Y_\alpha}Y_\alpha^T,\quad…

We focus on the FeigenbaumCoulletTresser point of the dissipative one-dimensional z logistic map. We show that sums of iterates converge to q Gaussian distributions, which optimize the nonadditive entropic functional Sq under simple…

Consider the setting of sparse graphs on N vertices, where the vertices have distinct "names", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some…

We study the central limit theorem (CLT) for linear eigenvalue statistics of several types of matrix models, whose entries are having exploding moments, i.e., moments of the entries are increasing with the size of the matrix. In particular,…

In the recent information-theoretic literature, the concept of extropy has been studied for order statistics. In the present communication we consider a cumulative analogue of extropy in the same vein of cumulative residual (past) entropy…

We obtain large deviations estimates for both sequential and random compositions of intermittent maps. We also address the question of whether or not centering is necessary for the quenched central limit theorems (CLT) obtained by Nicol,…

The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…

We study sample covariance matrices arising from multi-level components of variance. Thus, let $ B_n=\frac{1}{N}\sum_{j=1}^NT_{j}^{1/2}x_jx_j^TT_{j}^{1/2}$, where $x_j\in R^n$ are i.i.d. standard Gaussian, and…

We show that external randomization may enforce the convergence of test statistics to their limiting distributions in particular cases. This results in a sharper inference. Our approach is based on a central limit theorem for weighted sums.…

In this paper we consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in R^d and undergoing a binary, supercritical branching with a constant rate \lambda>0. This system is known to…

Classical Edgeworth expansions provide asymptotic correction terms to the Central Limit Theorem (CLT) up to an order that depends on the number of moments available. In this paper, we provide subsequent correction terms beyond those given…

Numerical experiments support the interesting conjecture that statistical methods be applicable not only to fully-chaotic systems, but also at the edge of chaos by using Tsallis' generalizations of the standard exponential and entropy. In…

Using Bernstein polynomial approximations, we prove the central limit theorem for linear spectral statistics of sample covariance matrices, indexed by a set of functions with continuous fourth order derivatives on an open interval including…

Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…

We consider N single server infinite buffer queues with service rate \beta. Customers arrive at rate N\alpha, choose L queues uniformly, and join the shortest. We study the processes R^N for large N, where R^N_t(k) is the fraction of queues…

This paper investigates the behavior of statistical ensembles under iteration map induced by discrete integrable Hamiltonian systems in deterministic case and stochastic case, addressing the problem from two perspectives: the Law of Large…

Hilhorst and Schehr recently presented a straight forward computation of limit distributions of sufficiently correlated random numbers \cite{hilhorst}. Here we present the analytical form of entropy which --under the maximum entropy…

In this paper, we study a stochastic strongly convex optimization problem and propose three classes of variable sample-size stochastic first-order methods including the standard stochastic gradient descent method, its accelerated variant,…

This note describes non-asymptotic variance and tail bounds for order statistics of samples of independent identically distributed random variables. Those bounds are checked to be asymptotically tight when the sampling distribution belongs…

Fix a base B and let zeta have the standard exponential distribution; the distribution of digits of zeta base B is known to be very close to Benford's Law. If there exists a C such that the distribution of digits of C times the elements of…