相关论文: Bourgain's Entropy Estimates Revisited

We explore consequences of a hyperbolic metric induced by the composition property of the Harvda-Charvat/Dar\'{o}czy/Cressie-Read/Tsallis entropy. We address the special case of systems described by small deviations of the non-extensive…

In this note, we show that the relative entropy of an empirical distribution of $n$ samples drawn from a set of size $k$ with respect to the true underlying distribution is exponentially concentrated around its expectation, with central…

This paper shows that, in the formal level, the convergence of solutions of Boltzmann equation to solutions of the compressible Navier-Stokes system with small Mach number over the three-dimensional periodic domain $\mathbb{T}^3$, using the…

The time evolution and stationary values of the entropy per particle of a homogeneous freely cooling granular gas, relative to the maximum entropy consistent with the instantaneous translational and rotational temperatures, is analyzed by…

The question of what is the total entropy of the universe, how it compares to the maximal entropy of de Sitter space, and how it is distributed across the universe's components, bears considerable importance for a number of reasons. Here,…

We present a stylized model of controlled equilibration of a small system in a fluctuating environment. We derive the equations governing the optimal control steering \emph{in finite time} the system between two equilibrium states. The…

Elaborating on the similarity between the entropy power inequality and the Brunn-Minkowski inequality, Costa and Cover conjectured in {\it On the similarity of the entropy power inequality and the Brunn-Minkowski inequality} (IEEE Trans.…

The subject is the overview of the use of quasi-entropy in finite dimensional spaces. Matrix monotone functions and relative modular operators are used. The origin is the relative entropy and the f-divergence, monotone metrics, covariance…

Bayes' theorem incorporates distinct types of information through the likelihood and prior. Direct observations of state variables enter the likelihood and modify posterior probabilities through consistent updating. Information in terms of…

If the N bosons that compose an ideal Bose-Einstein gas with energy E and volume V are each assumed to have the average energy of the system E/N, the entropy is easily expressed in terms of the number of bosons N and the number of…

We prove a central limit theorem for the entropic transportation cost between subgaussian probability measures, centered at the population cost. This is the first result which allows for asymptotically valid inference for entropic optimal…

We present new quantitative estimates for the radially symmetric configuration concerning Serrin's overdetermined problem for the torsional rigidity, Alexandrov's Soap Bubble Theorem, and other related problems. The new estimates improve on…

We study the behavior of R\'enyi entropies for pure states from standard assumptions about chaos in the high-energy spectrum of the Hamiltonian of a many-body quantum system. We compute the exact long-time averages of R\'enyi entropies and…

A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are…

We extend a result due to Bourgain on the uniform distribution of residues by proving that subsets of the type $f(I)\cdot H$ is equidistributed (as $p$ tends to infinity) where $f$ is a polynomial, $I$ is an interval of $\Fp$ and $H$ is an…

The weak law of large numbers implies that, under mild assumptions on the source, the Renyi entropy per produced symbol converges (in probability) towards the Shannon entropy rate. This paper quantifies the speed of this convergence for…

The paper gives a unified and simple proof of both theorems and Cousin's theorem.

Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the…

We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary…

As first shown by H. S. Green in 1952, the entropy of a classical fluid of identical particles can be written as a sum of many-particle contributions, each of them being a distinctive functional of all spatial distribution functions up to a…