Related papers: The Entropic Erd\H{o}s-Kac Limit Theorem

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…

We investigate the overdamped stochastic dynamics of a particle in an asymptotically flat external potential field, in contact with a thermal bath. For an infinite system size, the particles may escape the force field and diffuse freely at…

Erd\H{o}s-Stone Theorem is a well-known result in extremal graph theory which determines the asymptotic behaviour of maximum number of edges in an $n$-vertex $H$-free graph. In 2009, Nikiforov gave a spectral version of Erd\H{o}s-Stone…

We investigate here the behaviour of a large typical meandric system, proving a central limit theorem for the number of components of given shape. Our main tool is a theorem of Gao and Wormald, that allows us to deduce a central limit…

This paper establishes a central limit theorem and an invariance principle for a wide class of stationary random fields under natural and easily verifiable conditions. More precisely, we deal with random fields of the form $X_k =…

We show how to determine the maximum and minimum possible values of one measure of entropy for a given value of another measure of entropy. These maximum and minimum values are obtained for two standard forms of probability distribution (or…

This paper proves several assertions on sufficient conditions for the convergence of additive arithmetic functions to the normal distribution. A generalization of the Erdos-Kac theorem was proved and determines the rate of convergence of…

In this paper, we are concerned with centered Markov Additive Processes $\{(X_t,Y_t)\}_{t\in\T}$ where the driving Markov process $\{X_t\}_{t\in\T}$ has a finite state space. Under suitable conditions, we provide a local limit theorem for…

We explore an asymptotic behavior of entropies for sums of independent random variables that are convolved with a small continuous noise.

Capacity of entanglement (CoE), an information-theoretic measure of entanglement, defined as the variance of modular Hamiltonian, is known to capture the deviation from the maximal entanglement. We derive an exact expression for the average…

We prove a Egorov theorem, or quantum-classical correspondence, for the quantised baker's map, valid up to the Ehrenfest time. This yields a logarithmic upper bound for the decay of the quantum variance, and, as a corollary, a quantum…

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

We consider the central limit theorem for stable laws in the case of the standardized sum of independent and identically distributed random variables with regular probability density function. By showing decay of different entropy…

Edgeworth-type expansions for convolutions of probability densities and powers of the characteristic functions with non-uniform error terms are established for i.i.d. random variables with finite (fractional) moments of order $s \geq 2$,…

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…

The central limit theorem for Markov chains generated by iterated function systems consisting of orientation preserving homeomorphisms of the interval is proved. We study also ergodicity of such systems.

We address the issue of the Central Limit Theorem for (both local and global) empirical measures of diffusions interacting on a possibly diluted Erd\H{o}s-R\'enyi graph. Special attention is given to the influence of initial condition (not…

Explicit rate of convergence in variance (or more general entropies) is obtained for a class of Piecewise Deterministic Markov Processes such as the TCP process, relying on functional inequalities. A method to establish Poincar\'e (and more…

In the present work we use maximum entropy methods to derive several theorems in probabilistic number theory, including a version of the Hardy-Ramanujan Theorem. We also provide a theoretical argument explaining the experimental…