English
Related papers

Related papers: Entropy of Closure Operators

200 papers

We consider a simplified version of a solvable model by Mandal and Jarzynski, which constructively demonstrates the interplay between work extraction and the increase of the Shannon entropy of an information reservoir which is in contact…

Statistical Mechanics · Physics 2015-03-31 Neri Merhav

In this paper we explore how non trivial boundary conditions could influence the entanglement entropy in a topological order in 2+1 dimensions. Specifically we consider the special class of topological orders describable by the quantum…

High Energy Physics - Theory · Physics 2018-06-26 Chaoyi Chen , Ling-Yan Hung , Yingcheng Li , Yidun Wan

For statistical systems that violate one of the four Shannon-Khinchin axioms, entropy takes a more general form than the Boltzmann-Gibbs entropy. The framework of superstatistics allows one to formulate a maximum entropy principle with…

Classical Physics · Physics 2012-11-13 Rudolf Hanel , Stefan Thurner , Murray Gell-Mann

In the present paper we prove a family of tight upper and lower bounds for the Shannon entropy and von Neumann entropy based on the p-norms. This allows us to have an entropy estimate, a criterion for the finiteness of it and a bound on the…

Information Theory · Computer Science 2024-08-22 Juan Pablo Lopez

We present quantitative relations between work and information that are valid both for finite sized and internally correlated systems as well in the thermodynamical limit. We suggest work extraction should be viewed as a game where the…

Quantum Physics · Physics 2015-05-13 Oscar C. O. Dahlsten , Renato Renner , Elisabeth Rieper , Vlatko Vedral

This paper studies the behavior of the entropy numbers of classes of functions with bounded integral norms from a given finite dimensional linear subspace. Upper bounds of these entropy numbers in the uniform norm are obtained and applied…

Classical Analysis and ODEs · Mathematics 2020-01-30 F. Dai , A. Prymak , A. Shadrin , V. Temlyakov , S. Tikhonov

This work is an enquiry into the circumstances under which entropy methods can give an answer to the questions of both quantum separability and classical correlations of a composite state. Several entropy functionals are employed to examine…

Quantum Physics · Physics 2009-11-07 A. K. Rajagopal , R. W. Rendell

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at…

Cryptography and Security · Computer Science 2021-08-24 Iftach Haitner , Omer Reingold , Salil Vadhan , Hoeteck Wee

Information plays an important role in our understanding of the physical world. We hence propose an entropic measure of information for any physical theory that admits systems, states and measurements. In the quantum and classical world,…

Quantum Physics · Physics 2010-05-04 Anthony J. Short , Stephanie Wehner

Derivation of reduced order representations of dynamical systems requires the modeling of the truncated dynamics on the retained dynamics. In its most general form, this so-called closure model has to account for memory effects. In this…

Dynamical Systems · Mathematics 2020-06-12 Shaowu Pan , Karthik Duraisamy

We say that two free probability-measure-preserving actions of countable groups are Shannon orbit equivalent if there is an orbit equivalence between them whose associated cocycle partitions have finite Shannon entropy. We show that if the…

Dynamical Systems · Mathematics 2019-12-06 David Kerr , Hanfeng Li

We study the interplay between entropy and topological constraints for a polymer chain in which sliding rings (slip-links) enforce pair contacts between monomers. These slip-links divide a closed ring polymer into a number of sub-loops…

Statistical Mechanics · Physics 2009-11-07 Ralf Metzler , Andreas Hanke , Paul G. Dommersnes , Yacov Kantor , Mehran Kardar

We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\epsilon}-free push-down…

Formal Languages and Automata Theory · Computer Science 2019-04-25 Florian Starke

The present work is dedicated to searching parameters, alternative to entropy, applicable for description of highly organized systems. The general concept has been offered, in which the system complexity and order are functions of the order…

Information Theory · Computer Science 2010-09-03 V. I. Ilyevsky

The goal of the present paper is to derive some conditions on saturation of (strong) subadditivity inequality for the stochastic matrices. The notion of relative entropy of stochastic matrices is introduced by mimicking quantum relative…

Quantum Physics · Physics 2014-02-11 Lin Zhang

There are numerous characterizations of Shannon entropy and Tsallis entropy as measures of information obeying certain properties. Using work by Faddeev and Furuichi, we derive a very simple characterization. Instead of focusing on the…

Information Theory · Computer Science 2017-08-22 John C. Baez , Tobias Fritz , Tom Leinster

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…

Information Theory · Computer Science 2017-01-04 Günther Koliander , Georg Pichler , Erwin Riegler , Franz Hlawatsch

A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the function be kept secret from an eavesdropper with access to the…

Information Theory · Computer Science 2010-07-20 Himanshu Tyagi , Prakash Narayan , Piyush Gupta

We give a characterization of Maximum Entropy/Minimum Relative Entropy inference by providing two `strong entropy concentration' theorems. These theorems unify and generalize Jaynes' `concentration phenomenon' and Van Campenhout and Cover's…

Information Theory · Computer Science 2008-09-17 Peter Grunwald
‹ Prev 1 3 4 5 6 7 10 Next ›