Related papers: Kolmogorov--Nagumo Mean Frameworks for Conditional…
We propose a compression-based version of the empirical entropy of a finite string over a finite alphabet. Whereas previously one considers the naked entropy of (possibly higher order) Markov processes, we consider the sum of the…
Thermodynamic extensivity is commonly introduced as a postulate -- the homogeneity of degree one in thermodynamic potentials. We provide a constructive derivation of this property from microscopic conditions on the pair potential, without…
This paper gives upper and lower bounds on the minimum error probability of Bayesian $M$-ary hypothesis testing in terms of the Arimoto-R\'enyi conditional entropy of an arbitrary order $\alpha$. The improved tightness of these bounds over…
The growing interest of different entropy functions proposed so far (like the Bekenstein-Hawking, Tsallis, R\'{e}nyi, Barrow, Sharma-Mittal, Kaniadakis and Loop Quantum Gravity entropies) towards black hole thermodynamics as well as towards…
In this article we propose a quantum version of Shannon's conditional entropy. Given two density matrices $\rho$ and $\sigma$ on a finite dimensional Hilbert space and with $S(\rho)=-\tr\rho\ln\rho$ being the usual von Neumann entropy, this…
We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be…
The notion of group entropy is proposed. It enables to unify and generalize many different definitions of entropy known in the literature, as those of Boltzmann-Gibbs, Tsallis, Abe and Kaniadakis. Other new entropic functionals are…
An entropy for the scalar variable case, parallel to Havrda-Charvat entropy was introduced by the first author and the properties and its connection to Tsallis non-extensive statistical mechanics and the Mathai pathway model were examined…
Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. The reasons for the increasing popularity of this entropy in…
Kolmogorov introduced a concept of Epsilon-entropy to analyze information in classical continuous system. The fractal dimension of geometrical sets was introduced by Mandelbrot as a new criterion to analyze the complexity of these sets. The…
This paper is Part II of a two-part series on coexistence states study in stochastic generalized Kolmogorov systems under small diffusion. Part I provided a complete characterization for approximating invariant probability measures and…
We want to relate the concepts of entropy and pressure to that of KMS states for $C^*$-Algebras. Several different definitions of entropy are known in our days. The one we describe here is quite natural and extends the usual one for…
The aim of this paper is to reconsider the existence theory for steady compressible Navier--Stokes--Fourier system assuming more general condition of the dependence of the viscosities on the temperature in the form $\mu(\vartheta)$,…
In the nonextensive Tsallis scenario, Page's conjecture for the average entropy of a subsystem[Phys. Rev. Lett. {\bf 71}, 1291(1993)] as well as its demonstration are generalized, i.e., when a pure quantum system, whose Hilbert space…
We describe analytical properties of the average output entropy of a quantum channel as a function of a pair (channel, input ensemble). In particular, tight semicontinuity bounds for this function with the rank/energy constraints are…
In a recent paper, K.Keller has given a characterization of the Kolmogorov-Sinai entropy of a discrete-time measure-preserving dynamical system on the base of an increasing sequence of special partitions. These partitions are constructed…
This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. Leveraging a hierarchy of semidefinite programs…
Kolmogorov-Arnold Networks have emerged as interpretable alternatives to traditional multi-layer perceptrons. However, standard implementations lack principled uncertainty quantification capabilities essential for many scientific…
The combinatorial basis of entropy, given by Boltzmann, can be written $H = N^{-1} \ln \mathbb{W}$, where $H$ is the dimensionless entropy, $N$ is the number of entities and $\mathbb{W}$ is number of ways in which a given realization of a…
We propose a generalised framework for the updating of a prior ensemble to a posterior ensemble, an essential yet challenging part in ensemble-based filtering methods. The proposed framework is based on a generalised and fully Bayesian view…