Related papers: The Central Limit Theorem for uniformly strong mix…
Let $(X,\mu)$ be a standard probability space. An automorphism $T$ of $(X,\mu)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less…
We state the Central Limit Theorem, as the degree goes to infinity, for the normalized volume of the zero set of a rectangular Kostlan-Shub-Smale random polynomial system. This paper is a continuation of {\it Central Limit Theorem for the…
Consider a non-elementary Gromov-hyperbolic group $\Gamma$ with a suitable invariant hyperbolic metric, and an ergodic probability measure preserving (p.m.p.) action on $(X,\mu)$. We construct special increasing sequences of finite subsets…
We prove distributional limit theorems and one-sided laws of the iterated logarithm for a class of positive, mixing, stationary, stochastic processes which contains those obtained from non-integrable observables over certain piecewise…
This paper considers the estimation of Shannon entropy for discrete distributions with countably infinite support. While minimax rates for finite-support distributions are established, infinite-support distributions present distinct…
An instability property of the Birkhoff's ergodic theorem and related asymptotic laws with respect to small violations of algorithmic randomness is studied. The Shannon--McMillan--Breiman theorem and all universal compression schemes are…
We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…
A concentration property of the functional ${-}\log f(X)$ is demonstrated, when a random vector X has a log-concave density f on $\mathbb{R}^n$. This concentration property implies in particular an extension of the Shannon-McMillan-Breiman…
We establish a multivariate empirical process central limit theorem for stationary $\R^d$-valued stochastic processes $(X_i)_{i\geq 1}$ under very weak conditions concerning the dependence structure of the process. As an application we can…
In nature or societies, the power-law is present ubiquitously, and then it is important to investigate the mathematical characteristics of power-laws in the recent era of big data. In this paper we prove the superposition of non-identical…
It is expected that the statistical fluctuations of local observables in large quantum systems obey the central limit theorem, and approximate a normal distribution as their size grows. Here, we prove a version of the Berry-Esseen theorem…
We make use of an entropic property to establish a convergence theorem (Main Theorem), which reveals that the conditional entropy measures the asymptotic Gaussianity. As an application, we establish the {\it entropic conditional central…
There are three ways to conceptualize entropy: entropy as an extensive thermodynamic quantity of physical systems (Clausius, Boltzmann, Gibbs), entropy as a measure for information production of ergodic sources (Shannon), and entropy as a…
We give a simple proof of a central limit theorem for linear statistics of the Circular beta-ensembles which is valid at almost arbitrary mesoscopic scale and for functions of class C^3. As a consequence, using a coupling introduced by…
The well known maximum-entropy principle due to Jaynes, which states that given mean parameters, the maximum entropy distribution matching them is in an exponential family, has been very popular in machine learning due to its "Occam's…
We consider the existence of the integrated density of states (IDS) of the Anderson model on the Hilbert space $\ell^2(\mathbb{Z}^d)$ as analogues to the law of large numbers (LLN). In this work, we prove the analogues central limit theorem…
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.
The minimum error entropy (MEE) criterion has been successfully used in fields such as parameter estimation, system identification and the supervised machine learning. There is in general no explicit expression for the optimal MEE estimate…
This paper establishes central limit theorems for Polyak-Ruppert averaged Q-learning under asynchronous updates. We prove a non-asymptotic central limit theorem, where the convergence rate in Wasserstein distance explicitly reflects the…
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…