English
Related papers

Related papers: Entropy of probability kernels from the backwards …

200 papers

In this note we lay some groundwork for the resource theory of thermodynamics in general probabilistic theories (GPTs). We consider theories satisfying a purely convex abstraction of the spectral decomposition of density matrices: that…

Quantum Physics · Physics 2015-11-06 Howard Barnum , Jonathan Barrett , Marius Krumm , Markus P. Müller

We investigate the concept of entropy in probabilistic theories more general than quantum mechanics, with particular reference to the notion of information causality recently proposed by Pawlowski et. al. (arXiv:0905.2992). We consider two…

A topological dynamical system $(X,f)$ induces two natural systems, one is on the probability measure spaces and other one is on the hyperspace. We introduce a concept for these two spaces, which is called entropy order, and prove that it…

Dynamical Systems · Mathematics 2020-05-08 Yong Ji , Ercai Chen , Xiaoyao Zhou

In a recent paper Andrei N. Soklakov explained the foundations of the Lagrangian formulation of classical particle mechanics by means of Kolmogorov complexity. In the present paper we use some of Soklakov ideas in order to derive the second…

Mathematical Physics · Physics 2007-05-23 Adonai S. Sant'Anna

The Kolmogorov-Sinai (K-S) entropy is a central measure of complexity and chaos. Its calculation for many-body systems is an interesting and important challenge. In this paper, the evaluation is formulated by considering $N$-dimensional…

Chaotic Dynamics · Physics 2013-05-29 Arul Lakshminarayan , Steven Tomsovic

Strong subadditivity goes beyond the tensored subsystem and commuting operator models. As previously noted by Petz and later by Araki and Moriya, two subalgebras of observables satisfy a generalized SSA-like inequality if they form a…

Quantum Physics · Physics 2019-06-05 Li Gao , Marius Junge , Nicholas LaRacuente

We consider the concept of generalized measure-theoretic entropy, where instead of the Shannon entropy function we consider an arbitrary concave function defined on the unit interval, vanishing in the origin. Under mild assumptions on this…

Dynamical Systems · Mathematics 2014-08-21 Fryderyk Falniowski

Any decomposition of the total trajectory entropy production for Markovian systems has a joint probability distribution satisfying a generalized detailed fluctuation theorem, when all the contributing terms are odd with respect to time…

Statistical Mechanics · Physics 2010-10-26 Reinaldo Garcia-Garcia , Daniel Dominguez , Vivien Lecomte , Alejandro B. Kolton

We generalize, improve and unify theorems of Rumin, and Maassen--Uffink about classical entropies associated to quantum density matrices. These theorems refer to the classical entropies of the diagonals of a density matrix in two different…

Mathematical Physics · Physics 2015-05-30 Rupert L. Frank , Elliott H. Lieb

Given a general scalar balance law, i.e., in several space dimensions and with flux and source both space and time dependent, we focus on the functional properties of the entropy production. We apply this operator to entropy solutions, to…

Analysis of PDEs · Mathematics 2025-04-03 Rinaldo Colombo , Vincent Perrollaz

Let $(M,g)$ be a compact, boundaryless, Riemannian manifold whose geodesic flow on its unit sphere bundle is Anosov. Consider the (semiclassical) Laplace-Beltrami operator on $M$. Let $\epsilon >0$. We study the semiclassical measures…

Spectral Theory · Mathematics 2024-08-07 Suresh Eswarathasan

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…

Data Structures and Algorithms · Computer Science 2020-11-17 Michel Schellekens

The Poisson entropy of an infinite-measure-preserving transformation is defined as the Kolmogorov entropy of its Poisson suspension. In this article, we relate Poisson entropy with other definitions of entropy for infinite transformations:…

Dynamical Systems · Mathematics 2008-03-19 Elise Janvresse , Tom Meyerovitch , Emmanuel Roy , Thierry De La Rue

Generalized entropies are studied as Lyapunov functions for the Master equation (Markov chains). Three basic properties of these Lyapunov functions are taken into consideration: universality (independence of the kinetic coefficients),…

Statistical Mechanics · Physics 2007-05-23 Pavel Gorban

The first aims of this work are to endorse the advent of finitely additive set functions as equilibrium states and the possibility to replace the metric entropy by an upper semi-continuous map associated to a general variational principle.…

Dynamical Systems · Mathematics 2022-04-07 Andrzej Bis , Maria Carvalho , Miguel Mendes , Paulo Varandas

Entropies must correspond to mean values for them to be measurable. The Shannon entropy corresponds to the weighted arithmetic mean, whereas the Renyi entropy corresponds to the exponential mean. These means refer to code lengths, which are…

Statistical Mechanics · Physics 2011-10-25 B. H. Lavenda

We study the N-step binary stationary ergodic Markov chain and analyze its differential entropy. Supposing that the correlations are weak we express the conditional probability function of the chain through the pair correlation function and…

Statistical Mechanics · Physics 2015-06-24 S. S. Melnik , O. V. Usatenko

We consider the differential entropy of probability measures absolutely continuous with respect to a given $\sigma$-finite reference measure on an arbitrary measurable space. We state the asymptotic equipartition property in this general…

Information Theory · Computer Science 2021-07-12 Juan Pablo Vigneaux

In this paper we investigate a notion of relative operator entropy, which develops the theory started by J.I. Fujii and E. Kamei [Math. Japonica 34 (1989), 341--348]. For two finite sequences $\mathbf{A}=(A_1,...,A_n)$ and…

Functional Analysis · Mathematics 2014-11-04 A. Morassaei , F. Mirzapour , M. S. Moslehian

Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation,…

Data Structures and Algorithms · Computer Science 2017-04-18 Mathias Bæk Tejs Knudsen , Mikkel Thorup
‹ Prev 1 3 4 5 6 7 10 Next ›